Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
An adaptive virtual queue (AVQ) algorithm for active queue management
IEEE/ACM Transactions on Networking (TON)
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Spatial Node Distribution of the Random Waypoint Mobility Model with Applications
IEEE Transactions on Mobile Computing
Performance analysis of mobility-assisted routing
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Location Dependent Cooperative Caching in MANET
ICPP '08 Proceedings of the 2008 37th International Conference on Parallel Processing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
The challenges of disconnected delay-tolerant MANETs
Ad Hoc Networks
Statistical QoS routing for IEEE 802.11 multihop ad hoc networks
IEEE Transactions on Wireless Communications
From opportunistic networks to opportunistic computing
IEEE Communications Magazine
IEEE Communications Surveys & Tutorials
Opportunistic networking: data forwarding in disconnected mobile ad hoc networks
IEEE Communications Magazine
Message Drop and Scheduling in DTNs: Theory and Practice
IEEE Transactions on Mobile Computing
Link stability-aware reliable packet transmitting mechanism in mobile ad hoc network
International Journal of Communication Systems
Hi-index | 0.00 |
According to the store-carry-forward packet transmission method, nodes can communicate with each other in intermittently connected mobile network flexibly. As can be seen, the successful transmission of packets is assisted by multiple copies injected into the network. Therefore, the limited buffer should be utilized reasonably in this situation. In this paper, an adaptive buffer scheduling mechanism is proposed with the aid of packet transmission status estimation. According to the activity degree of node and the number of packet copies, the status of packet transmission in the network can be evaluated. Furthermore, with the estimated outcome of packet redundancy, the packets in the buffer are scheduled dynamically. Numerical results show that the activity degree can be estimated accurately, especially when the networks become larger. The number of packet copies can be proved that it follows normal distribution. Compared with other buffer scheduling mechanisms, our mechanism displays better performance, e.g., the packet delivery probability is enhanced by 21---50 %, and the latency is reduced by 15---23 %.