| Media access protocols can be classified as either demand assigned or random access. Demand assigned protocols are often inflexible, inefficient under diverse traffic, and do not scale well to large networks. Random access schemes usually suffer from collisions and cannot manage the multi-frequency capabilities of many radios. We present new results on our pseudorandom message scheduling approach. A number of global message schedules are established whereby schedules denote message start opportunities. Each node is assigned unique message start schedules, which can be either transmission or reception based. The paradigm has been extended to manage multiple frequency channels. An optional RTS/CTS along with our boomerang acknowledgement concept improves link reliability in situations where hidden nodes are present. In dense networks, sub-networking can be performed. We demonstrate in networks, where nodes use transmission based start times along with conventional carrier sense channel access, collision free communications. |