Figure 1 - uploaded by Ravi Prakash
Content may be subject to copyright.
Source publication
In mobile computing systems the network configuration changes due to node mobility. The paper identifies the issues a group communication service has to take into account in order to handle node mobility. These include the need to identify the location of a node, and the ability to cope with inaccuracies in the determination of a group membership....
Context in source publication
Citations
... Many recent routing protocols designed for mobile ad-hoc networks deal with mobility in a Virtual Cellular Network (VCN) model [3], where the ad-hoc network is divided into possibly overlapping cells with a base station to handle the communications of each cell. The base stations of VCN can be fixed/mobile, and they are connected by the wireless medium. ...
The highly dynamic and uncertain character of mobile ad-hoc networks poses significant challenges for group management. Node mobility often changes the multicast tree, and therefore, frequent updates from group members are required to refresh the multicast tree at the source node. This paper presents Courier, a group communications algorithm that uses the location and velocity of roaming nodes to provide bandwidth efficient multicast between a source and its destinations (i.e., group members) in location aware mobile environments. Toward that end, Courier offers (1) a bandwidth efficient method for location updates from group members, (2) a mobility prediction model for predicting the movement of mobile group members, and (3) an overlay multicast data distribution tree (OMDDT) construction algorithm that is guided by the mobility prediction model. Comparisons of Courier to related multicast algorithms indicate an increase in data transmission success and a decrease in overall bandwidth consumption.
... Different groups can be merged when they move into a common geographical area and the partition of one group can be handled as multiple disjoint groups. Another further approach [12] uses not only the ad-hoc network, but also the cellular network and a Virtual Cellular Network (VCN). A Proximity Layer protocol monitors all network nodes within a certain area.Based on this information a three-round group membership protocol builds a group of mobile nodes. ...
This paper presents a group communication system for mobile devices, called MobileGCS. Mobile communication is slow, expensive and suffers from occasionally disconnections, especially when users are in movement. MobileGCS is based on SMS and enables group communication despite these restrictions. It provides all primitives needed for a chat application and handles process failures. As mobile communication is expensive, MobileGCS is designed for small message overhead and, additionally, exploits SMS based message relaying to handle short-term disconnections. In this work, we present the group maintenance service and the multicast service of MobileGCS. In order to distribute the overhead of failure discovery over all processes we introduce the concept of a circle of responsibility for failure detection. We discuss informally that MobileGCS can handle the most common failures while keeping the message overhead very low.
... Once the recipient node receives the data packet, an acknowledgment is sent in the modified token to the sending node, which converts the packet into the original token and returns the token to the network. As each node can only hold a token for a specified duration, the repetition of this cycle results in a deterministic, predictable access to the medium for all node on the network (Prakash and Baldoni, 1998). ...
Problem statement: The communications domain has utilized the implementation of protocols for a wide spectrum of applications. This encompasses Medium Access Control (MAC) protocols. MAC protocols have been extensively researched from several angles. This encompasses the implementation in the area of Wave Division Multiplexing (WDM) networks and Mobile Adhoc Networks (MANET). The relevance of intelligence in sustaining the pre-requisites for dynamic reconfiguration has gained an integral attention in MANET. Approach: The implementation of Token Ring in MANET can be correlated to its complementary implementation in IP networks. In this paper, the limitation of Token Ring algorithm for IP netwo rks in the context of intelligent processing has be en researched extensively. An enhanced Token Ring protocol governed by intelligent processing has been implemented in this paper. The core of the new prot ocol is based on the circulation mechanism of the token. As opposed to the traditional circulatory me chanism, a software agent is designed to become an intelligent circulatory agent is this research. The developed software agent is utilized to implement prioritized token access subject to the traffic typ e. Each station is coupled with a software agent wh o cohesively collaborates to assign the token. Results: The proposed agent and the enhanced Token Ring implementation have been extensively verified throu gh simulation experiments. A complete circulation of the ring is defined upon all nodes being visited at least once. Discrete-event simulation models we re developed and deployed for the purpose of performance analysis. The results acquired validated the improved results of the new software agent based implementation. The performance metrics studied were average delay and average buffer utilization. Conclusion: The proposed algorithm has enabled to derive an ideal balance between the complexity of i ntelligent processing and the versatility of managing the token ring.
... Once the recipient node receives the data packet, an acknowledgment is sent in the modified token to the sending node, which converts the packet into the original token and returns the token to the network. As each node can only hold a token for a specified duration, the repetition of this cycle results in a deterministic, predictable access to the medium for all node on the network (Prakash and Baldoni, 1998). The token passing protocol and the token circulation mechanism have been studied and analyzed from different aspects in different type of networks. ...
Problem statement: The communications domain has utilized the implementation of protocols for a wide spectrum of applications. This encompasses Medium Access Control (MAC) protocols. MAC protocols have been extensively researched from several angles. This encompasses the implementation in the area of Wave Division Multiplexing (WDM) networks and Mobile Adhoc Networks (MANET). The relevance of intelligence in sustaining the pre-requisites for dynamic reconfiguration has gained an integral attention in MANET. Approach: The implementation of Token Ring in MANET can be correlated to its complementary implementation in IP networks. In this paper, the limitation of Token Ring algorithm for IP networks in the context of intelligent processing has been researched extensively. An enhanced Token Ring protocol governed by intelligent processing has been implemented in this paper. The core of the new protocol is based on the circulation mechanism of the token. As opposed to the traditional circulatory mechanism, a software agent is designed to become an intelligent circulatory agent is this research. The developed software agent is utilized to implement prioritized token access subject to the traffic type. Each station is coupled with a software agent who cohesively collaborates to assign the token. Results: The proposed agent and the enhanced Token Ring implementation have been extensively verified through simulation experiments. A complete circulation of the ring is defined upon all nodes being visited at least once. Discrete-event simulation models were developed and deployed for the purpose of performance analysis. The results acquired validated the improved results of the new software agent based implementation. The performance metrics studied were average delay and average buffer utilization. Conclusion: The proposed algorithm has enabled to derive an ideal balance between the complexity of intelligent processing and the versatility of managing the token ring.
... Different groups can be merged when they move into a common geographical area and the partition of one group can be handled as multiple disjoint groups. Another further approach [13] uses not only the ad-hoc network, but also the cellular network and a Virtual Cellular Network (VCN). A Proximity Layer protocol monitors all network nodes within a certain area and forwards changes to the Group Membership Layer. ...
This paper presents a group communication system for mobile devices, called DistributedGCS. Mobile communication is slow,
expensive and suffers from occasional disconnections, especially when users are moving. DistributedGCS is based on SMS and
enables group communication despite these restrictions. It provides all primitives needed for a chat application and handles
process failures. As mobile communication is expensive, DistributedGCS is designed for small message overhead and, additionally,
exploits SMS based message relaying to handle short-term disconnections. In this work, we present the group maintenance service
and the multicast service of DistributedGCS. In order to distribute the overhead of failure discovery over all processes we
introduce the concept of a circle of responsibility for failure detection. We discuss informally that DistributedGCS can handle
the most common failures properly while keeping the message overhead very low.
... Many recent routing protocols designed for mobile ad-hoc networks deal with mobility in a Virtual Cellular Network (VCN) model (Prakash and Baldoni, 1998), ...
... Prakash and Baldoni [12] propose protocols for group communication support in virtual cellular networks where base-stations can move, and for ad-hoc networks. In contrast, we consider a network with stationary base-stations. ...
Nash equilibrium is the most commonly-used notion of equilibrium in game theory. However, it suffers from numerous problems. Some are well known in the game theory community; for example, the Nash equilibrium of repeated prisoner's dilemma is neither ...
... we will intend to use this problem as a starting point for understanding the relation between the capabilities and the difficulties of several communication models described in [19]. It will be interesting to study the role and strength according to the communication models. ...
... Like the implementation problems of observation, communication in physical robotics is not also free or reliable and can be constrained by limited bandwidth and range, and unpredictable interference. Therefore, as an additional motivation, we will intend to use this problem as a starting point for understanding the relation between the capabilities and the difficulties of several communication models described in [19]. It will be interesting to study the role and strength according to the communication models. ...
In this study, we focus on a self-deployment problem for a swarm of autonomous mobile robots that can be used to build a sensor networking infrastructure with equilateral triangle lattice configurations. In order to deploy the swarm, this paper proposes a self-stabilizing distributed self- deployment algorithm under a robot model with the following features: no identification numbers, no common coordinates, no predetermined leader, no memory for past actions and implicit communication. Regardless of the restricted model, our proposed algorithm based on local interactions provides a solution for the self-deployment problem. Moreover, the algorithm provides robust capability of swarm connectivity in spite of loss of several robots. We discuss in details the features of the algorithm, including self-organization, self-stabilization, and robustness. A simulation study demonstrates the validity of the algorithm.
... Different simulations were done, with different network sizes (10,15,20,30,50 nodes) we observed the variation of the power consumption with the packet size in case of sending and receiving. Tables (6,7) show that the power consumption is linearly increased with the packet size in case of sending and receiving respectively in different network sizes. ...
Power management in mobile network is an open challenges where the power level in the network influences the network life time. However, there are a trade off between the power consumption and the connectivity in mobile networks. We present a topology control mechanism and a routing protocol for Ad-Hoc wireless networks that chooses the shortest path given the lower power consumption. The power consumption in forwarding a packet in the proposed topology is depends on only two main factors are the number of hops and the packet size. Our analytical results are confirmed by our simulation results where both has give the same results for power consumption in sending a packet taking in consideration only the power consumed in communication.
... In wireless mobile networks, more and more collaborative applications appear, e.g., several military units or rescue teams form a group and work in different locations to accomplish the common tasks [LAW05,PRA98]. We name this type of group as a distributed group. ...
