An analysis of mobile radio ad hoc networks using clustered architectures

Sköld, Markus; Choi, Yeongyoon; Nilsson, Josef

doi:10.1109/vetecs.2003.1207526

Cited by 2 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [17], the route hold time is calculated in terms of mobility for flat routing and cluster-based routing, and the values for each type of routing are compared with respect to the amount of data transmitted before any routing breakage. However, no attention is given to the analysis of a specific routing scheme or additional clustering costs due to node mobility.…”

Section: Related Workmentioning

confidence: 99%

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Im¹,

Lee

2011

Wireless Netw

View full text Add to dashboard Cite

Ad hoc networks have a scalability problem. When the nodes of an ad hoc network increase in number or mobility, the amount of control traffic for routing increases and could cause traffic congestion. Cluster-based routing schemes have been proposed as a solution to this problem. Typical cluster-based ad hoc networks use a proactive routing scheme for intra-cluster routes and a reactive routing scheme for inter-cluster routes. In this study, we propose a new clusterbased routing scheme for ad hoc networks which makes use of the mobility of nodes. Nodes are divided into two groups on the basis of their mobility. For a route search within a cluster, a proactive routing scheme is used for low-mobility nodes and a flooding-based reactive routing scheme is used for highmobility nodes. The required control traffic of the proposed scheme is analyzed and optimal parameters of the proposed scheme are derived from the analysis. The numerical results show that the proposed scheme produces far less control traffic than a typical cluster-based routing scheme.

show abstract

Section: Related Workmentioning

confidence: 99%

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Im¹,

Lee

2011

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…[9][10][11][12] presented the comparison of several main algorithms. These algorithms are under the assumption that the hosts in the mobile network have the same characteristic.…”

Section: Model Establishmentmentioning

confidence: 99%

Calculation of minimal dominating set in wireless sensor network with host switch-on/off

Zhang

Jia

2010

Trans. Tianjin Univ.

View full text Add to dashboard Cite

Abstract：This paper proposes a simple and efficient distributed algorithm for calculating minimal dominating set in wireless sensor network. This method can avoid maintaining the connectivities between backbone hosts. Considering that the hosts in mobile networks have different characteristics, this paper proposes a method of calculating minimal dominating set with weight. The nodes can be chosen to form a minimal dominating set when the network topology changes. For the host switch on/off operation, the updating algorithm was provided. The change in the status of a host affects only the status of hosts in the restricted vicinity. Simulation results show that the proposed method can ensure fewer dominators but with higher weight to form the minimal dominating set and the nodes can be adaptive to the changes of network topology. Keywords：wireless sensor network; virtual backbone; minimal dominating set; switch-on/off Wireless sensor network (WSN) can be flexibly and quickly deployed in many applications such as automated battlefield operations, search and rescue, and disaster relief [1] . Routing in WSN is a special challenge. Traditional routing protocols in wired network, which generally use either link state [2,3] or distance vector [4,5] , are no longer suitable for WSN. Routing information has to be localized to adapt quickly to the host switch-on/off changes. Refs.[6] and [7] provided a simple and effective method to construct the minimal connected dominating set (MCDS). Routing based on MCDS makes the routing process be simplified to a subnet. MCDS applied as a foundation of hierarchical routing can effectively find routing and reduce communication latency. When the entire network topology changes, only the local state information of nodes needs to be modified.If the network topology changes too fast, the host switch-on/off operation will have an impact on neighboring nodes, which makes maintaining the connectivity of the connected dominating set and updating routing tables become more complex and difficult. Most MCDS algorithms are rarely involved in updating and maintaining problems. This paper presents a minimal dominating set algorithm in WSN. Virtual backbone network with minimal dominating set is constructed. Considering different characteristic among the hosts in WSN, this paper presents a minimal dominating set algorithm with weight. This method can avoid sustaining the connectivity between backbone nodes. The updating algorithms is also discussed, when topology changes, the backbone network can be rapidly reconstructed and facilitate maintenance. In addition, the locality of hosts status update is verified. Model establishmentA simple undirected graph G = (V, E) is adopted to represent WSN, where V is a node set, and each node represents a sensor node; E is an edge set, each edge e = (u, v) ∈ E (u, v∈ V) indicates that both nodes u and v are within their wireless transmitter ranges, i.e., the connectivities of nodes are based on geographic distances of nodes. ( represents the open neighboring set ...

show abstract

An analysis of mobile radio ad hoc networks using clustered architectures

Cited by 2 publications

References 3 publications

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Optimal cluster-based routing scheme using node mobility in ad hoc networks

Calculation of minimal dominating set in wireless sensor network with host switch-on/off

Contact Info

Product

Resources

About