![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Industrial Papers Today's mobile ad-hoc networking approaches require nodes to maintain network topology and routing tables, which limits network scalability. This paper proposes soft mobile ad-hoc networks in which nodes do not maintain network topology and routing tables. We show that soft networks are feasible, have less overhead than existing approaches under many conditions, and may achieve the best possible end-to-end delay performance among all known ad-hoc networking approaches with little scalability degradation. ![]() DiSC'02 © 2003 Association for Computing Machinery |