—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...
—In this paper, we propose a novel coalitional game model for security issues in wireless networks. The model can be applied to not only mobile ad hoc networks but also wireless ...
—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...
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...