Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
Increasing need for people to be “connected”; while at the same time remain as mobile as ever poses several interesting issues in wireless networks. It is conceivable in the n...
Alok Nandan, Shirshanka Das, Giovanni Pau, Mario G...
Multi-hop routing is essential to the operation of wireless ad hoc networks. Unfortunately, it is very easy for an adversary to forge or modify routing messages to inflict severe ...
Qing Li, Yih-Chun Hu, Meiyuan Zhao, Adrian Perrig,...