The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
We address the problem of balancing the traffic load in multi-hop wireless networks. We consider a point-to-point communicating network with a uniform distribution of source-sink ...
Lucian Popa 0002, Afshin Rostamizadeh, Richard M. ...
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
—In this paper, we describe and analyze the design of a joint Transport, Routing and Spectrum Sharing (TRSS) optimization algorithm for wireless networks with frequencyagile radi...
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...