Network coding awareness based fairly scheduling protocol in wireless network

Authors:
Chen Huang;Furong Wang;Bin Dai;Bo Zhang
Affiliations:
Huazhong University of Science and Technology, China;Huazhong University of Science and Technology, China;Huazhong University of Science and Technology, China;Huazhong University of Science and Technology, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 8
Cited 0

A distance routing effect algorithm for mobility (DREAM)

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks

Wireless Networks
The performance of query control schemes for the zone routing protocol

IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A Random Linear Network Coding Approach to Multicast

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless Ad hoc network (MANET) has been adopted in many applications. It usually has limited bandwidth and computational capacity, so it may prefer fewer transmissions in the network. It is vital for one node to minimize the transmission delay. Traditional optimization algorithm tended to achieve the best performance only for some nodes in the network while neglecting others. In this work, we investigate a simple and effective routing protocol for service time allocation in wireless Ad hoc network. We obtain an accurate parameter that can reflect the service time received by one node. Our aim is to provide low computational data distribution service for all the nodes in wireless Ad hoc network.