Enhanced Cluster Head Selection Approach for small scale and large scale network in WSN for improving energy efficiency

Label propagation spreads the soft labels from few labeled data to a large amount of unlabeled data according to the intrinsic graph structure. Nonetheless, most label propagation solutions work under relatively small-scale data and fail to cope with many real applications, such as social network analysis, where graphs usually have millions of nodes. In this paper, we propose a novel algorithm named \algo to deal with large-scale data. A lightweight iterative process derived from the well-known stochastic gradient descent strategy is used to reduce memory overhead and accelerate the solving process. We also give a theoretical analysis on the necessity of the warm-start technique for label propagation. Experiments show that our algorithm can handle million-scale graphs in few seconds while achieving highly competitive performance with existing algorithms.

Download Full-text

Novel model for boosting security strength and energy efficiency in internet-of-things using multi-staged game

International Journal of Electrical and Computer Engineering (IJECE) ◽

10.11591/ijece.v9i5.pp4326-4335 ◽

2019 ◽

Vol 9 (5) ◽

pp. 4326 ◽

Cited By ~ 1

Author(s):

Bhagyashree Ambore ◽

Suresh L

Keyword(s):

Energy Efficiency ◽

Internet Of Things ◽

Large Scale ◽

Research Work ◽

Balance Performance ◽

Large Scale Network ◽

Joint Solution ◽

Scale Network ◽

Threat Mitigation ◽

Novel Model

Security as well as energy efficiency is one of the most inevitable and challenging problems when it comes it large scale network deployment like INternet-of-Things (IoT). After reviewing existing research work on IoT, it was found that there are discrete set of solution for security as well as for energy. However, there is little research work that has jointly investigated both the problems with respect to IoT. Apart from this, there are also various form of attacks that cost energy of sensors that constitutes core physical devices in IoT. Therefore, these manuscripts present a novel idea for identifying and resisting the security breach within an IoT system ensuring energy efficiency too. Harnessing the modelling capability of game-theory, the proposed system offers a joint solution towards these problems. The simulated outcome of the study is found to offer balance performance for better energy efficiency and robust threat mitigation capability when compared with existing approaches.

Download Full-text

A Hierarchical and Abstraction-Based Blockchain Model

Applied Sciences ◽

10.3390/app9112343 ◽

2019 ◽

Vol 9 (11) ◽

pp. 2343 ◽

Cited By ~ 3

Author(s):

Swagatika Sahoo ◽

Akshay M. Fajge ◽

Raju Halder ◽

Agostino Cortesi

Keyword(s):

Large Scale ◽

Abstract Interpretation ◽

Organizational Structures ◽

Network Size ◽

Small Scale ◽

Time Interval ◽

Huge Number ◽

Large Scale Network ◽

Regular Time ◽

Scale Network

In the nine years since its launch, amid intense research, scalability is always a serious concern in blockchain, especially in case of large-scale network generating huge number of transaction-records. In this paper, we propose a hierarchical blockchain model characterized by: (1) each level maintains multiple local blockchain networks, (2) each local blockchain records local transactional activities, and (3) partial views (tunable w.r.t. precision) of different subsets of local blockchain-records are maintained in the blockchains at next level of the hierarchy. To meet this objective, we apply abstractions on a set of transaction-records in a regular time interval by following the Abstract Interpretation framework, which provides a tunable precision in various abstract domain and guarantees the soundness of the system. While this model suitably fits to the real-worlds organizational structures, the proposal is powerful enough to scale when large number of nodes participate in a network resulting into an enormous growth of the network-size and the number of transaction-records. We discuss experimental results on a small-scale network with three sub networks at lower-level and by abstracting the transaction-records in the abstract domain of intervals. The results are encouraging and clearly indicate the effectiveness of this approach to control exponential growth of blockchain size w.r.t. the total number of participants in the network.

Download Full-text

A Topology Visualization Early Warning Distribution Algorithm for Large-Scale Network Security Incidents

The Scientific World JOURNAL ◽

10.1155/2013/827376 ◽

2013 ◽

Vol 2013 ◽

pp. 1-7

Author(s):

Hui He ◽

Guotao Fan ◽

Jianwei Ye ◽

Weizhe Zhang

Keyword(s):

Network Security ◽

Network Topology ◽

Early Warning ◽

Early Warning System ◽

Large Scale ◽

Warning System ◽

Small Scale ◽

Large Scale Network ◽

Scale Network ◽

Security Incidents

It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system’s emergency response capabilities, alleviate the cyber attacks’ damage, and strengthen the system’s counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system’s plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks’ topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.

Download Full-text

An improved cluster head selection approach for energy efficiency in wireless sensor networks: A review

2015 International Conference on Pervasive Computing (ICPC) ◽

10.1109/pervasive.2015.7087190 ◽

2015 ◽

Cited By ~ 2

Author(s):

Snehal P. Dongare ◽

R. S. Mangrulkar

Keyword(s):

Energy Efficiency ◽

Wireless Sensor Networks ◽

Sensor Networks ◽

Cluster Head ◽

Wireless Sensor ◽

Cluster Head Selection ◽

Selection Approach

Download Full-text

NSF Launches Large-Scale Network for Small-Scale Science

Physics Today ◽

10.1063/1.1688065 ◽

2004 ◽

Vol 57 (2) ◽

pp. 34-34

Author(s):

Toni Feder

Keyword(s):

Large Scale ◽

Small Scale ◽

Large Scale Network ◽

Scale Network

Download Full-text

Routing Protocol berbasis Cluster Segitiga

JURNAL TEKNIK INFORMATIKA ◽

10.15408/jti.v4i2.2009 ◽

2015 ◽

Vol 4 (2) ◽

Author(s):

Nurhayati Nurhayati

Keyword(s):

Routing Protocol ◽

Large Scale ◽

Cluster Head ◽

Network Routing ◽

Base Station ◽

Sensor Nodes ◽

Wireless Sensor ◽

Small Scale ◽

Long Distance ◽

Scale Network

Wireless sensor networks users are increasing drastically in communication and technology. They consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. However, the smaller of a device the better it is. The development of device should be user friendly. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. In BCDCP, all sensors send data from CH (Cluster Head) and then to BS (Base Station). BCDCP works well in small-scale network but in large scale network it is not appropriated since it uses much energy for long distance wireless communication. We propose a routing protocol - Triangular Clustering Routing Protocol (TCRP) - to prolong network life time through the balanced energy consumption. RPTC selects cluster head of triangular shape. The sensor field is divided into energy level and in every level we choose one node as a gate node. This gate node collects data and sends it to the leader node. Finally the leader node sends the aggregated data to the BS. We show TCRP outperforms BCDCP with several experiments. Key words: Wireless Sensor Network, Routing Protocol, Clustering

Download Full-text

Research on MAC Protocols in Cluster-Based Ad Hoc Networks

Wireless Communications and Mobile Computing ◽

10.1155/2021/5513469 ◽

2021 ◽

Vol 2021 ◽

pp. 1-12

Author(s):

Yutao Liu ◽

Yue Li ◽

Yimeng Zhao ◽

Chunhui Zhang

Keyword(s):

Ad Hoc Networks ◽

Large Scale ◽

Ad Hoc ◽

Mac Protocol ◽

Cluster Head ◽

Small Scale ◽

Control Overhead ◽

Large Scale Network ◽

Hoc Networks ◽

Network Overhead

Mobile ad hoc networks can be widely used in many scenes, for example, military communication, emergency communication, and 5G wide area coverage as well as ultradense network scenes. A cluster-based network can decrease network overhead effectively and then constitute a large-scale network through extending network scale by clustering and cascading. In view of multiservice simultaneous transmission demand for small-scale dense networking scene and large-scale extended networking scene, a MAC protocol based on scheduling of cluster head is proposed, which can avoid collision and retransmission between nodes effectively, and then the network synchronizing in intercluster and intracluster as well as the time-slot scheduling is solved fast and efficiently. A network synchronization algorithm based on clock spread of the sponsorship node is proposed to achieve network self-synchronizing, and a modified schedule-tree algorithm based on cluster head and exactly sponsorship node is proposed to decrease network overhead and to increase network fairness, then MAC protocol based on scheduling of cluster head is verified by simulated analysis. Finally, a dynamic gateway selection algorithm based on link stability is proposed in this paper to decrease intercluster communication control overhead and improve intercluster communication reliability.

Download Full-text