Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks

Area of Science:

• Computer Science
• Wireless Networking
• Algorithm Design

Background:

• Ad hoc sensor networks face challenges in efficient data transportation, especially with real-time constraints.
• Utilizing mobile nodes in stationary networks presents opportunities for improved routing efficiency.
• Meeting hard packet deadlines is critical for quality of service (QoS) in many network applications.

Purpose of the Study:

• To develop a greedy data transportation scheme for ad hoc sensor networks.
• To leverage mobile nodes with scheduled trajectories to minimize total routing cost.
• To ensure end-to-end packet deadlines are satisfied while optimizing network performance.

Main Methods:

• A greedy routing strategy is proposed where stationary nodes decide between relaying to another stationary node or a passing mobile node.
• Mobile nodes are incorporated based on their scheduled paths and arrival times.
• Network-level simulations are used to evaluate the routing algorithm's performance.

Main Results:

• The proposed algorithm effectively utilizes the time available before packet deadlines to reduce overall routing costs.
• Significant improvements in packet delivery ratio and reductions in packet delivery time were observed.
• The scheme demonstrates the ability to guarantee packet delivery within hard deadlines, enhancing QoS.

Conclusions:

• The greedy data transportation scheme successfully integrates mobile nodes to optimize routing in ad hoc sensor networks.
• The algorithm provides a robust solution for meeting hard packet deadlines, improving network efficiency and reliability.
• This approach contributes to enhanced Quality of Service (QoS) for various network services requiring timely data delivery.