—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...
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
We consider the problem of inter-cluster routing between cluster heads via intermediate sensor nodes in a hierarchical sensor network. Sensor nodes having limited and unreplenishab...
—Significant progress has been made in understanding the behavior of TCP and congestion-controlled traffic over multihop wireless networks. Despite these advances, however, no ...
— Simulation is frequently used in the study of multi-agent systems. Unfortunately, in many cases, it is not necessarily clear how faithfully the details of the simulated model r...
Christopher M. Cianci, Jim Pugh, Alcherio Martinol...