Optimization and routing discovery for ad hoc wireless networks: a cross layer approach

Authors:
Reizel Casaquite;Won-Joo Hwang
Affiliations:
Department of Information and Communications Engineering, Inje University, Gimhae, Gyungnam, South Korea;Department of Information and Communications Engineering, Inje University, Gimhae, Gyungnam, South Korea
Venue:
ICHIT'06 Proceedings of the 1st international conference on Advances in hybrid information technology
Year:
2006

Citing 6
Cited 0

Power-aware routing in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
Energy-aware on-demand routing protocols for wireless ad hoc networks

Wireless Networks
Design challenges for energy-constrained ad hoc wireless networks

IEEE Wireless Communications
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks

IEEE Communications Magazine
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless communication links are time-varying in nature, causing degradation of network's performance; this however, could be alleviated by allowing cross layer interaction in the protocol stack. Hence, optimization problems formulated in this paper considered parameters from the physical, MAC, and network layers where an optimal transmission power vector that minimizes the overall transmission power of the network, satisfying the SINR, required data rate, and maximum transmission power constraints was formulated to exist. Distributed algorithms for the joint scheduling, power control and routing were also derived and an energy-aware routing algorithm which maximizes network lifetime was proposed. The energy consumed by each node in the routing path and delays associated on each transmission were considered as link cost such that a route with minimum link cost is utilized. Basically, the routing algorithm searched an energy-efficient route, satisfying the energy constraint of each node in a routing path at a tolerable delay.