The week's pick
Random Articles
Reseach Article
Article:Consistent Global Data Structure in MANET
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 6 - Number 7 |
| Year of Publication: 2010 |
| Authors: K.K.Basheer, V.Venkata Ramana, A. Rama Mohan Reddy |
10.5120/1086-1417
|
K.K.Basheer, V.Venkata Ramana, A. Rama Mohan Reddy . Article:Consistent Global Data Structure in MANET. International Journal of Computer Applications. 6, 7 ( September 2010), 37-42. DOI=10.5120/1086-1417
Abstract
Our ultimate goal is to provide application developers with the ability to maintain a consistent global data structure in a setting in which mobile hosts come and go as they please and engage in reliable transient collaborative activities. In this context, the group membership service needs to provide an accurate snapshot of the membership view all the time, and a message entrusted in a view shall be guaranteed to be delivered to members in that view, despite motion and motion-induced disconnections. This property makes the group membership service useful for many mobile applications, such as those we mentioned earlier. Next, we seek to formally define the group membership problem.
References
- F. Christian, “Relying on safe distance to achieve strong partition able group membership specifications in AdHoc networks," Distributed Computing, vol. 4, no. 4, pp. 175-188, 1991.
- F. Christian, “Reaching agreement on processor-group membership in synchronous distributed systems," Distributed Computing, vol. 4, no. 4, pp. 175-188, 1991
- Y. Amir, D. Dolev, S. Kramer, and D. Malki, “Transis: A communication subsystem for high availability," in FTCS-22: 22nd International Symposium on Fault Tolerant Computing, Boston, Massachusetts, 1992, pp.76-84, IEEE Computer Society Press
- K. P. Birman, “The process group approach to reliable distributed computing," Communications of the ACM, vol. 36, no. 12, pp. 37-53, December 1993.
- A. Ricciardi and K. Birman, ”Process membership in asynchronous environments," Tech. Rep. 93-1328, Cornell University, Department of Computer Science, February 1993.
- Y. Amir, L. E. Moser, P. M. Melliar-Smith, D. A. Agarwal, and P. Ciarfella, “The Totem single-ring ordering and membership protocol," ACM Transactions on Computer Systems, vol . 13, no. 4, pp. 311-342, 1995 .
- P. D. Ezhilchelvan, R. A. Macedo, and S. K. Shrivastava, “Newtop: A fault-tolerant group communication protocol," in Proceedings of the International Conference on Distributed Computing Systems, 1995, pp. 296-306
- L. E. Moser, P. M. Melliar-Smith, D. A. Agarwal, R. K. Budhia, and Colleen A. Lingley-Papadopoulos, “Totem: A fault-tolerant multicast group communication system," Communications of the ACM, vol. 39, no. 4, pp. 54-63, 1996 .
- R. van Renesse, K.P. Birman, and S. Ma_eis, “Horus, a exible group communication system," Communications of the ACM, vol. 39, no. 4, pp. 76-83, April 1996.
- R. Prakash and R. Baldoni, “Architecture for Group Communication in Mobile Systems," in Proceedings of the IEEE Symposium on Reliable Distributed Systems (SRDS), October 1998, pp. 235-242.
- O. Babaoglun, R. Davoli, and A. Montresor, “Group communication in partitionable systems: Specification and algorithms," IEEE Transactions on Software Engineering, vol. 27, no. 4 , pp. 308-336, April 2001
Index Terms
Keywords