A distributed architecture for multimedia in dynamic wireless networks

Lin, Chun-Hung Richard; Gerla, Mário

doi:10.1109/glocom.1995.502646

Cited by 62 publications

(24 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [9,13], multi-hop, multi-cluster packet radio network architectures are proposed. The provisioning of quality of service is discussed based on``dynamic virtual circuit'' communications derived from wireline network control and signaling found in ATM networks.…”

Section: Introductionmentioning

confidence: 99%

INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks

Lee

Ahn

Zhang

et al. 2000

Journal of Parallel and Distributed Computing

320

179

View full text Add to dashboard Cite

Section: Introductionmentioning

confidence: 99%

INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks

Lee

Ahn

Zhang

et al. 2000

Journal of Parallel and Distributed Computing

320

179

View full text Add to dashboard Cite

“…Experiments demonstrate that the system has a low rate of clusterhead change but the throughput is low under this scheme. Typically, each cluster was assigned some resources which was shared among the members of that cluster on a round-robin basis [6,7,8]. As the number of nodes in a cluster is increased, the throughput of each user drops and hence a gradual degradation in the system performance is observed.…”

Section: Previous Workmentioning

confidence: 99%

“…Clusters may change dynamically, reflecting the mobility of the nodes. The focus of the existing research has been on just partitioning the network into clusters [2,3,7,8,6], without taking into consideration the efficient functioning of all the system components. The lack of rigorous methodologies for the design and analysis of peer-to-peer mobile networks has motivated in-depth research in this area.…”

Section: Introductionmentioning

confidence: 99%

A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks

Chatterjee

Das

Turgut

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due to the mobility of the nodes. The association and dissociation of nodes to and from clusters perturb the stability of the network topology, and hence a reconfiguration of the system is often unavoidable. However, it is vital to keep the topology stable as long as possible. The clusterheads, which form a dominant set in the network, determine the topology and its stability. Our weight based distributed clustering algorithm takes into consideration the ideal degree, transmission power, mobility and battery power of a mobile node. We try to keep the number of nodes in a cluster around a pre-defined threshold to facilitate the optimal operation of the medium access control (MAC) protocol. The non-periodic procedure for clusterhead election gradually improves the load balance factor (LBF) which is a measure of the load distribution among the clusterheads. For lowering the computation and communication costs, the clustering algorithm is invoked on-demand which aims to maintain the connectivity of the network at the cost of load imbalance. Simulation experiments are conducted to evaluate the performance of our algorithm in terms of the number of clusterheads, reaffiliation frequency and dominant set updates. Results show that the our algorithm performs better than the existing algorithms and is also tunable to different types of ad hoc networks.

show abstract

“…The authors of [4] [5] proposed the idea of assigning a unique ID to each node in the network and then broadcasting the ID to all the neighbour nodes. In the next step, the IDs that were error-freely decoded are compared and the node having the lowest ID is chosen as the cluster-head, while its single-hop neighbours become the cluster members.…”

Section: ) Lowest Id (Lid) Clustering Algorithmmentioning

confidence: 99%

“…Numerous clustering algorithms based on different optimization objectives have been proposed [1][2][3][4][5][6][7]. The most popular ad hoc clustering algorithms may be classified as follows.…”

Section: Introductionmentioning

confidence: 99%

A Cluster-Head Selection and Update Algorithm for Ad Hoc Networks

Zhang

Hanzo

2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

Abstract-A novel cluster-head selection and update algorithm "Typebased Cluster-forming Algorithm (TCA)" is proposed, which outperforms both the lowest node ID (LID) and the Weighted Clustering Algorithm (WCA) in the ad hoc network scenario considered. The system's performance is investigated in a scenario, when the 50 communicating nodes belong to three different groups, for example, a group of rescue workers, fire-fighters and paramedics. It is demonstrated that the carefully designed protocol is capable of outperforming the above-mentioned benchmarkers both in terms of a reduced number of cluster-head updates and cluster-change events. Hence its quality-of-service may be deemed higher.

show abstract

A distributed architecture for multimedia in dynamic wireless networks

Cited by 62 publications

References 5 publications

INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks

INSIGNIA: An IP-Based Quality of Service Framework for Mobile ad Hoc Networks

A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks

A Cluster-Head Selection and Update Algorithm for Ad Hoc Networks

Contact Info

Product

Resources

About