Effective management through prediction-based clustering approach in the next-generation ad hoc networks

Sivavakeesar, S.; Pavlou, George; Bohoris, C; Liotta, Antonio

doi:10.1109/icc.2004.1313364

Cited by 13 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Network tools such as virtualization [32] and clustering [33], [34], [35], [36] have also been used to address the redundancy reduction task [37]. Two main types of virtualization have been proposed in the context of WSN: (1) virtualization of sensors (i.e., virtual sensors) and (2) virtualization of sensor networks (i.e., virtual sensor networks or sensor cloud).…”

Section: Redundancy Reduction In Wsnsmentioning

confidence: 99%

Redundancy Reduction in Wireless Sensor Networks via Centrality Metrics

Mocanu

Vega

Liotta

2015

2015 IEEE International Conference on Data Mining Workshop (ICDMW)

View full text Add to dashboard Cite

Abstract-The advances in wireless communications, together with the need of sensing and controlling various nature or human made systems in a large number of points (e.g. smart traffic control, environmental monitoring), lead to the emergence of Wireless Sensor Networks (WSN) as a powerful tool to fulfill the above requirements. Due to the large amount of wireless devices needed and cost constraints, such networks are usually made by low-cost devices with limited energy and computational capabilities, these further on being subject to easy communication or hardware fails. At the same time, the deployment of such devices in harsh environments (e.g. in the ocean) may lead to uncontrollable redundant topologies which have to be often refined during the exploitation phase of these networks in an automated manner. In the scope of these arguments, in this paper, we take advantage of the latest theoretical advances in complex networks and we propose an automated solution to refine the topology of WSNs by using centrality metrics to detect the redundant nodes and links in a network, and further on to shut down them safely. Our solution may work in both ways, centralized or decentralized, by choosing a centralized or a decentralized centrality metric, this choice being driven by the application goal. The experiments performed on a wide variety of network topologies with different sizes (e.g. number of nodes and links), using different centrality metrics, validate our approach and recommend it as a solution for the automatic control of WSNs topologies during the exploitation phase of such networks to optimize, for instance, their life time.

show abstract

Section: Redundancy Reduction In Wsnsmentioning

confidence: 99%

Redundancy Reduction in Wireless Sensor Networks via Centrality Metrics

Mocanu

Vega

Liotta

2015

2015 IEEE International Conference on Data Mining Workshop (ICDMW)

View full text Add to dashboard Cite

show abstract

“…The idea behind this model are Virtual Cluster Concept, (P xk , T xk , D xk ) -Clustering approach and Mobility prediction model [4] .…”

Section: Nmmentioning

confidence: 99%

“…Due to larger distances, the end-to-end data latency also increases. In order to overcome these problems, ECC security mechanism [1][2][3] and a prediction based proactive hierarchical network [4] structure has been considered.…”

Section: Introductionmentioning

confidence: 99%

Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

Vijayalakshmi¹,

Palanivelu²

2007

J. of Computer Science

View full text Add to dashboard Cite

Abstract:The secure end-to-end route discovery in the decentralized Mobile Adhoc Networks (MANETs) should have to meet the requirements of prevention of DoS attacks on data traffic, should be adaptive and fault tolerant and must have high speed, low energy overhead and scalability for future development. In this research a secure routing using antnet mechanism and mutual authentication using Elliptic Curve Cryptography (ECC) has been proposed to meet the above requirements. The common perception of public key cryptography is that it is not well suited for adhoc networks as they are very complex and slow. Against this popular belief, this research implements Elliptic Curve Cryptographya public key cryptography scheme. ECC provides a similar level of security to conventional integerbased public-key algorithms, but with much shorter keys. Because of the shorter keys ECC algorithms run faster, require less space and consume less energy. These advantages make ECC a better choice of public key cryptography, especially for a resource constrained systems like MANETs. Using the antnet routing algorithm, the highly trustable route will be selected for data transfer and each Mobile Node (MN) in MANET maintains the trust value of its one-hop neighbors. The mutual authentication between source and destination is done by master key exchange using Elliptic Curve Cryptography (ECC).

show abstract

“…An efficient clustering algorithm must adapt itself to frequently and unpredictable topology changes known in ad hoc networks. It must also generate stable clusters as much as possible to prohibit their updates which can lead to update other information as routing, security, addressing and management information [1,2].…”

Section: Introductionmentioning

confidence: 99%

Lowest Weight: Reactive Clustering Algorithm for Adhoc Networks

Elhdhili

Azzouz

Kamoun

2006

Personal Wireless Communications

View full text Add to dashboard Cite

In this paper, we address clustering in ad hoc networks. Ad hoc networks are a wireless networking paradigm in which mobile hosts rely on each other to keep the network connected without the help of any pre-existing infrastructure or central administrator. Thus, additional features pertinent to this type of networks appeared. In fact, centralized solutions are generally inadaptable due to the need for cooperative network operations. To ensure efficient, tolerant and durable cooperative operations, nodes need to organize themselves. Clustering is an organization method which consists in grouping the nodes into clusters (groups) managed by nodes called clusterheads. In this paper, we present existing clustering algorithms and propose a new solution inspired from two of these algorithms (Lowest Id and WCA). This solution, called Lowest Weight, exploits their advantages and relieve to their drawbacks in terms of clusters stability and computational overhead. Simulation experiments were conducted to evaluate the performance of the algorithm proposed in terms of clusters numbers, clusterheads lifetime and the number of reaffiliations (node moving from a cluster to another). Results show that Lowest Weight ameliorate performs of existing algorithms especially regarding mobility leading to more suitable, adaptable, scalable and autonomous clustering.

show abstract

Effective management through prediction-based clustering approach in the next-generation ad hoc networks

Cited by 13 publications

References 8 publications

Redundancy Reduction in Wireless Sensor Networks via Centrality Metrics

Redundancy Reduction in Wireless Sensor Networks via Centrality Metrics

Secure Antnet Routing Algorithm for Scalable Adhoc Networks Using Elliptic Curve Cryptography

Lowest Weight: Reactive Clustering Algorithm for Adhoc Networks

Contact Info

Product

Resources

About