Micro-ANP：A Novel Network Protocol Architecture for Underwater Sensor Network

2013 ◽  
Vol 303-306 ◽  
pp. 223-230 ◽  
Author(s):  
Xiu Juan Du ◽  
Ke Jun Huang ◽  
Fan Liu ◽  
Zhen Xing Feng ◽  
Sheng Lin Lan
Keyword(s):  
Sensor Network ◽  
Limited Resource ◽  
Network Protocol ◽  
Size Optimization ◽  
Matlab Simulation ◽  
Packet Size ◽  
Architecture Model ◽  
Network Transport ◽  
Underwater Sensor Network ◽  
Protocol Architecture

Underwater sensor network (UWSN) adopts acoustic communication and is characterized by high delay, low bandwidth, high error rate, low energy-consumption requirement and sparse topology, which lead to conventional network protocols for terrestrial WSN or other wireless multi-hop networks are unable to satisfy the performance of UWSN. On the other hand, the limited resources of energy, CPU and memory cause that the protocol stack running on the sensor node shouldn’t be much complicated. The paper proposes a novel, green network protocol architecture model tailored for UWSN, referred to as Micro-ANP, which is three layered structure including application, network transport, and physical layer. Furthermore, basing on Micro-ANP we realize the packet size optimization of UWSN through Matlab simulation. Micro-ANP protocol architecture and packet size optimization improve the energy efficiency of UWSN, prolong the network lifetime and achieve green network while meeting the requirement of QoS with the constraints of limited resource.

Wireless Sensor Networks

2012 ◽  
pp. 305-328
Author(s):  
Low Tang Jung ◽  
Azween Abdullah
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Channel Model ◽  
Channel Modeling ◽  
Optimization Techniques ◽  
Data Packet ◽  
Wireless Sensor ◽  
Size Optimization ◽  
Packet Size ◽  
Data Packets

This chapter presents the studies and analysis on the approaches, the concepts, and the ideas on data packet size optimization for data packets transmission in underwater wireless sensor network (UWSN) and terrestrial wireless sensor network (TWSN) communications. These studies are based on the related prior works accomplished by the UWSN and TWSN research communities. It should be mentioned here that the bulk of the studies and analysis would be on the data packet size optimization techniques or approaches rather than on the communication channel modeling, but the channel model is deemed essential to support the optimization approaches. The various optimization solutions proposed in the prior arts are dealt with in depth to explore their feasibilities to accommodate the data packet size optimization algorithm proposed by the various researchers. This chapter starts off with the studies and analysis on prior arts found in UWSN and then moves on to the similar works found elsewhere in the TWSN communications counterparts. A comparison on some important issues related to data packet size optimization approaches used in UWSN and TWSN communications are summarized in a table at the end of this chapter. The findings in this chapter may be helpful to readers who are interested in the R&D of data packet size optimization techniques with the intention to formulate new data packet size optimization framework or algorithms.

scholarly journals Multi-Radio Based Rendezvous Technique for Heterogeneous Cognitive Radio Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (9) ◽  
pp. 2997
Author(s):  
Md. Tahidul Islam ◽  
Sithamparanathan Kandeepan ◽  
Robin. J. Evans
Keyword(s):  
Cognitive Radio ◽  
Sensor Network ◽  
Dynamic Network ◽  
Optimal Number ◽  
Matlab Simulation ◽  
Cognitive Radio Sensor Network ◽  
Rendezvous Technique ◽  
Central Controller ◽  
Blind Rendezvous ◽  
Analytical Expressions

In a distributed cognitive radio (CR) sensor network, transmission and reception on vacant channels require cognitive radio nodes to achieve rendezvous. Because of the lack of adequate assistance from the network environment, such as the central controller and other nodes, assisted rendezvous for distributed CR is inefficient in a dynamic network. As a result, non-assisted blind rendezvous, which is unaware of its counterpart node, has recently led to a lot of interest in the research arena. In this paper, we study a channel rendezvous method based on prime number theory and propose a new multi-radio-based technique for non-assisted rendezvous with the blind and heterogeneous condition. The required time and the optimal number of radios for the guaranteed rendezvous are calculated using probability-based measurement. Analytical expressions for probabilistic guaranteed rendezvous conditions are derived and verified by Monte Carlo simulation. In addition, the maximum time to rendezvous (MTTR) is derived in closed form using statistical and probabilistic analysis. Under different channel conditions, our proposed solution leads to a substantial time reduction for guaranteed rendezvous. For the sake of over-performance of our proposed system, the simulation outcome is compared to a recently proposed heterogeneous and blind rendezvous method. The Matlab simulation results show that our proposed system’s MTTR gains range from 11% to over 95% for various parametric values of the system model.

Sign in / Sign up

Export Citation Format

Share Document