Database Reference
In-Depth Information
capabilities and the local learning with a new distance evaluation technique, a
routing technique that improves the average path length measures of W-Grid
networks.
Besides, the work has showed that in case of failures, W-Grid guarantees net-
work robustness while reducing the energy consumption with respect to existing
solutions that instead require broadcast/flooding propagations. In particular, the
simulations have measured both the ecacy and eciency of the routing method
and the recovery approach according to an extensive number of scenarios with
different radio connectivity density, with several logical network topology chang-
ing the number of coordinates and with the treatment of node failures.
The results have highlighted that the routing performance of GPSR and W-
Grid with local learning are quite similar despite GPSR requires GPS; finally
the new recovery approach drastically reduces the network trac while preserv-
ing the same recovery ecacy of solutions based on costly broadcast/flooding
operations.
Future work is manly oriented towards integrating W-Grid with novel
paradigms dictated by recent Big Data initiatives (e.g., [26,27]), perhaps in-
spired by approximation paradigms (e.g. [28,29]).
References
1. Monti, G., Moro, G., Lodi, S.: W*-Grid a robust decentralized cross-layer infras-
tructure for routing and multi-dimensional data management in wireless ad-hoc
sensor networks. In: P2P 2007, pp. 159-166 (2007)
2. Monti, G., Moro, G.: Scalable multi-dimensional range queries and routing in dat-
acentric sensor networks. In: Infoscale 2008(2008)
3. Li, X., Kim, Y., Govindan, R., Hong, W.: Multi-dimensional range queries in sensor
networks. In: SenSys 2003, pp. 63-75. ACM Press, New York (2003)
4. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed
diffusion for wireless sensor networking. IEEE/ACM Trans. Netw. 11, 2-16 (2003)
5. Ye, F., Luo, H., Cheng, J., Lu, S., Zhang, L.: A two-tier data dissemination model
for large-scale wireless sensor networks. In: MobiCom 2002, pp. 148-159. ACM
Press, New York (2002)
6. Perkins, C., Bhagwat, P.: Highly dynamic destination-sequenced distance-vector
routing (DSDV) for mobile computers. In: SIGCOMM 1994, pp. 234-244. ACM
Press, New York (1994)
7. Chiang, W.L.C., Wu, H., Gerla, M.: Routing in clustered multihop, mobile wireless
networks. In: IEEE SICON, pp. 197-211 (1997)
8. Murthy, S., Garcia-Luna-Aceves, J.J.: An e cient routing protocol for wireless
networks. Mob. Netw. Appl. 1, 183-197 (1996)
9. Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: WMCSA
1999, p. 90. IEEE Computer Society (1999)
10. Johnson, D., Maltz, D., Broch, J.: DSR: the dynamic source routing protocol for
multihop wireless ad hoc networks. Ad hoc Networking, 139-172 (2001)
11. Park, V., Corson, M.S.: A highly adaptive distributed routing algorithm for mo-
bile wireless networks. In: INFOCOM 1997, p. 1405. IEEE Computer Society,
Washington, DC (1997)
Search WWH ::




Custom Search