Multipath code casting for wireless mesh networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Horizon: balancing tcp over multiple paths in wireless mesh network
Proceedings of the 14th ACM international conference on Mobile computing and networking
Review: Survey of multipath routing protocols for mobile ad hoc networks
Journal of Network and Computer Applications
Optimized multipath network coding in lossy wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
ICT'09 Proceedings of the 16th international conference on Telecommunications
Evolutionary routing-path selection in congested communication networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Efficient multipath in wireless networks using network coding over braided meshes
International Journal of Sensor Networks
Reliable congestion-aware information transport in wireless sensor networks
International Journal of Communication Networks and Distributed Systems
Applying swarm intelligence to a novel congestion control approach for wireless sensor networks
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Congestion control in wireless sensor networks based on bird flocking behavior
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Beacon-Less Geographic Multipath Routing Protocol for Ad Hoc Networks
Mobile Networks and Applications
Hi-index | 0.00 |
We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approachconsists of a multipath routing protocol, Biased Geographical Routing (BGR), and two congestion control algorithms, In-NetworkPacket Scatter (IPS) and End-to-End Packet Scatter (EPS), which leverage BGR to avoid the congested areas of the network.BGR achieves good performance while incurring a communication overhead of just 1 byte per data packet, and has a computationalcomplexity similar to greedy geographic routing. IPS alleviates transient congestion by splitting traffic immediately beforethe congested areas. In contrast EPS alleviates long term congestion by splitting the flow at the source, and performing ratecontrol. EPS selects the paths dynamically, and uses a less aggressive congestion control mechanism on non-greedy paths toimprove energy efficiency. Simulation and experimental results show that our solution achieves its objectives. Extensive ns-2simulations show that our solution improves both fairness and throughput as compared to single path greedy routing. Our solutionreduces the variance of throughput across all flows by 35%, reduction which is mainly achieved by increasing throughput oflong-range flows with around 70%. Furthermore, overall network throughput increases by approximately 10%. Experimental resultson a 50-node testbed are consistent with our simulation results, suggesting that BGR is effective in practice.