TDMA channel access scheduling with neighbor indirect acknowledgment algorithm (NbIA) for ad-hoc networks
View Patent ↗A mobile ad-hoc network (MANET) includes a source mobile node, a destination mobile node, and a plurality of neighboring mobile nodes. The mobile nodes are operative for contending for a plurality of time division multiple access (TDMA) slots in a frame using beacons. Each neighboring node selects a TDMA slot per frame. For neighboring nodes not receiving an acknowledgment for successful beacons, those nodes contend on empty TDMA slots and resolve residual collisions using a collision detection mechanism.
1. A method for operating a mobile ad-hoc network (MANET) comprising a plurality of mobile nodes and a plurality of wireless communications links connecting the mobile nodes together, which comprises:
an “n” number of mobile nodes concurrently contending for a plurality of Time Division Multiple Access (TDMA) slots in a frame using beacons from mobile nodes that are neighboring an n-hop distance to a source mobile node;
each neighboring node selecting a TDMA slot per frame and acknowledging any successful beacons;
for neighboring nodes not receiving an acknowledgement for successful beacons, contending on empty TDMA slots; and
resolving residual collisions for those neighboring nodes that had not received an acknowledgement for successful beacons using a collision detection mechanism utilizing a message exchange mechanism with a first neighboring node by temporarily exchanging a beacon transmission time with a second neighboring node wherein the first and second neighboring nodes each transmit their beacons in the other nodes' beacon slot for reception by a neighboring node to detect beacon collisions.
2. The method according to claim 1 , wherein said neighboring nodes are positioned within a two-hop distance.
3. The method according to claim 1 , wherein each node continues on a TDMA slot for a plurality of frames.
4. The method according to claim 1 , wherein the step of resolving residual collisions comprises using a void of bits within a Beacon Occupancy Vector (BOV).
5. The method according to claim 1 , which further comprises embedding an acknowledgement message into a beacon by selecting most recently heard beacons that are referenced to a transmission time within a single frame.
6. The method according to claim 1 , which further comprises propagating a timing reference throughout the network for synchronizing a plurality of mobile nodes.
7. The method according to claim 6 , which further comprises determining a timing reference by synchronizing with a mobile node that has a global positioning sensor (GPS) or synchronizing with a mobile node that is selected to represent a network timing reference.
8. The method according to claim 6 , which further comprises adopting within a mobile node a received timing reference from a packet when the mobile node has not synchronized its internal timing to an external timing reference.
9. The method according to claim 6 , which further comprises synchronizing within a node to a timing reference that has been received and has a higher preference than the timing reference that the node has already been synchronized.
10. A method for operating a mobile ad-hoc network (MANET) comprising a plurality of mobile nodes and a plurality of wireless communications links connecting the mobile nodes together, which comprises:
an “n” number of mobile nodes concurrently contending for a plurality of Time Division Multiple Access (TDMA) slots in a frame using beacons from mobile nodes that are neighboring an n-hop distance to a source mobile node;
each neighboring node selecting a TDMA slot per frame and acknowledging any successful beacons;
for neighboring nodes not receiving an acknowledgement for successful beacons, contending on empty TDMA slots; and
resolving residual collisions for those neighboring nodes that had not received an acknowledgement for successful beacons by exchanging a transmission schedule with a selected neighboring node using a void of bits within a Beacon Occupancy Vector (BOV) and a two-level BOV to distribute TDMA slot occupancy information to neighboring nodes and compensating for topology change due to node movement.
11. The method according to claim 10 , wherein said neighboring nodes are positioned within a two-hop distance.
12. The method according to claim 10 , wherein each node continues on a TDMA slot for a plurality of frames.
13. The method according to claim 10 , which further comprises embedding an acknowledgement message into beacon slot contentions for reducing beacon bandwidth requirements.
14. The method according to claim 10 , which further comprises receiving an acknowledgement of a beacon and maintaining a transmit schedule.
15. The method according to claim 10 , which further comprises propagating a timing reference throughout the network for synchronizing a plurality of mobile nodes.
16. The method according to claim 15 , which further comprises determining a timing reference by synchronizing with a mobile node that has a global positioning sensor (GPS) or synchronizing with a mobile node that is selected to represent a network timing reference.
17. The method according to claim 15 , which further comprises adopting within a mobile node a received timing reference from a packet when the mobile node has not synchronized its internal timing to an external timing reference.
18. The method according to claim 15 , which further comprises synchronizing within a node to a timing reference that has been received and has a higher preference than the timing reference that the mobile node has already been synchronized.
19. A mobile ad-hoc network (MANET) comprising:
a source mobile node;
a destination mobile node; and
a plurality of neighboring mobile nodes, wherein said neighboring mobile nodes are operative for concurrently contending for a plurality of Time Division Multiple Access (TDMA) slots in a frame using beacons, each neighboring node selecting a TDMA slot per frame and acknowledging any successful beacons, wherein for neighboring nodes not receiving an acknowledgement for successful beacons, contending on empty TDMA slots and resolving residual collisions for those neighboring nodes that had not received an acknowledgement for successful beacons using a collision detection mechanism using a message exchange mechanism with a first neighboring node by temporarily exchanging a beacon transmission time with a selected second neighboring node wherein the first and second neighboring nodes each transmit their beacons in the other nodes' beacon slot for reception by a neighboring node to detect beacon collisions.
20. The MANET according to claim 19 , wherein each mobile node comprises a communications device to communicate wirelessly with other mobile nodes, and a controller to route communications via the communications device.
21. The MANET according to claim 19 , and further comprising a timing reference that is propagated throughout the network for synchronizing a plurality of mobile nodes.
22. The MANET according to claim 19 , and further comprising a mobile node having a global positioning sensor (GPS) to which other mobile nodes are synchronized.
23. The MANET according to claim 19 , and further comprising a mobile node that is operative as a network timing reference.