International Journal of Mobile Network Design and Innovation http://www.inderscience.com/browse/index.php?journalID=154&year=2011&vol=3&issue=4 Inderscience Publishers Ltd en-uk International Journal of Mobile Network Design and Innovation 1744-2869 1744-2850 © 2011 Inderscience Publishers Ltd editor@inderscience.com https://www.inderscience.com/images/files/coverImgs/ijmndi_scoverijmndi.jpg http://www.inderscience.com/browse/index.php?journalID=154&year=2011&vol=3&issue=4 http://www.inderscience.com/link.php?id=42559 Mobile ad hoc networks (MANETs) consist of a number of wireless hosts that forms network without a fixed infrastructure. Clustering plays a vital role for MANETs in managing the resources. Clustering involves two processes such as cluster head election and cluster maintenance. Since cluster head ensures the network performance, it is important to elect the desired cluster heads. In this paper, an enhanced weight-based clustering algorithm using a mobility prediction scheme (EWCAMP) for finding the desired cluster head is proposed. In the cluster maintaining phase the proposed algorithm defines the admission criteria for newly arriving nodes, which helps the nodes in joining the correct cluster. The goals of the proposed algorithm are reducing the number of clusters and re-affiliation of nodes. We have evaluated the performance of the proposed algorithm using network simulator (NS2). The simulation results demonstrate the superior performance of the proposed algorithm. An enhanced clustering algorithm for mobile ad hoc networks to improve the throughput
S. Muthuramalingam; R. Rajaram
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 191 - 197
Mobile ad hoc networks (MANETs) consist of a number of wireless hosts that forms network without a fixed infrastructure. Clustering plays a vital role for MANETs in managing the resources. Clustering involves two processes such as cluster head election and cluster maintenance. Since cluster head ensures the network performance, it is important to elect the desired cluster heads. In this paper, an enhanced weight-based clustering algorithm using a mobility prediction scheme (EWCAMP) for finding the desired cluster head is proposed. In the cluster maintaining phase the proposed algorithm defines the admission criteria for newly arriving nodes, which helps the nodes in joining the correct cluster. The goals of the proposed algorithm are reducing the number of clusters and re-affiliation of nodes. We have evaluated the performance of the proposed algorithm using network simulator (NS2). The simulation results demonstrate the superior performance of the proposed algorithm.

]]> 10.1504/IJMNDI.2011.042559 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 191 - 197 S. Muthuramalingam; R. Rajaram Department of Information Technology, Thiagarajar College of Engineering, Thiruparankundram, Madurai, Tamilnadu, 625015, India. ' Department of Information Technology, Thiagarajar College of Engineering, Thiruparankundram, Madurai, Tamilnadu, 625015, India mobile ad hoc networks MANETS cluster heads clustering re-affiliation throughput improvement mobile networks cluster head election mobility prediction cluster maintenance simulation. 2011-09-17T23:20:50-05:00 3 4 191 197 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42560 OFDM/OQAM technique is one of the leading candidates for future wireless systems. This technique does not employ guard regions and as a direct consequence, the wasted resources (time/power) allocated to the guard interval in the OFDM/QAM system are directly used to convey useful data; this guarantees a higher spectral efficiency and a throughput increase. The objective of this paper is to maximise the sum of the users data rates subject to the overall transmit power constraint and BER requirement for multiuser OFDM/OQAM downlink transmission. As demonstrated in the simulation results, the proposed OFDM/OQAM algorithm offers better performance than previous OFDM/QAM algorithms in the literature. Adaptive bit and subcarrier allocation algorithm for multiuser OFDM/OQAM systems
Khalid El Baamrani; Ayad Habib; Raja Elassali
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 198 - 203
OFDM/OQAM technique is one of the leading candidates for future wireless systems. This technique does not employ guard regions and as a direct consequence, the wasted resources (time/power) allocated to the guard interval in the OFDM/QAM system are directly used to convey useful data; this guarantees a higher spectral efficiency and a throughput increase. The objective of this paper is to maximise the sum of the users data rates subject to the overall transmit power constraint and BER requirement for multiuser OFDM/OQAM downlink transmission. As demonstrated in the simulation results, the proposed OFDM/OQAM algorithm offers better performance than previous OFDM/QAM algorithms in the literature.

]]> 10.1504/IJMNDI.2011.042560 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 198 - 203 Khalid El Baamrani; Ayad Habib; Raja Elassali Department of Telecommunications, ENSA of Marrakech, University Cadi Ayyad, P.O. Box 575, Marrakech, Morocco. ' Department of Telecommunications, ENSA of Marrakech, University Cadi Ayyad, P.O. Box 575, Marrakech, Morocco. ' Department of Telecommunications, ENSA of Marrakech, University Cadi Ayyad, P.O. Box 575, Marrakech, Morocco multiuser OFDM offset QAM quadrature amplitude modulation OQAM filter bank-based multicarriers FBMC bit allocation subcarrier allocation mobile networks orthogonal frequency division multiplexing simulation. 2011-09-17T23:20:50-05:00 3 4 198 203 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42561 In this paper, we analyse a decoding algorithm, which corrects both erasures and errors for Reed-Solomon (RS) codes based on the Euclidean algorithm together with the Berlekamp-Massey (BM) algorithm. We present and discuss the implementation of RS codes in the digital video broadcasting (DVB) standards and give a brief review of the new DVB-H standard. Analysis and simulation of the symbol error rate (SER) versus the output SER for the Reed-Solomon code used for the multi-protocol encapsulation-forward error correction (MPE-FEC) block in DVB-H has been conducted. Applications of Reed-Solomon codes in mobile digital video communications systems
Izabella Lokshina
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 204 - 208
In this paper, we analyse a decoding algorithm, which corrects both erasures and errors for Reed-Solomon (RS) codes based on the Euclidean algorithm together with the Berlekamp-Massey (BM) algorithm. We present and discuss the implementation of RS codes in the digital video broadcasting (DVB) standards and give a brief review of the new DVB-H standard. Analysis and simulation of the symbol error rate (SER) versus the output SER for the Reed-Solomon code used for the multi-protocol encapsulation-forward error correction (MPE-FEC) block in DVB-H has been conducted.

]]> 10.1504/IJMNDI.2011.042561 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 204 - 208 Izabella Lokshina Management, Marketing and Information Systems, SUNY-Oneonta, NY 13820, USA wireless communications digital video broadcasting DVB Reed-Solomon codes Euclidean algorithm Berlekamp-Massey algorithm multi-protocol encapsulation-forward error correction MPE-FEC DVB-H standard network performance performance improvement mobile digital video decoding algorithms. 2011-09-17T23:20:50-05:00 3 4 204 208 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42562 This paper proposes a new multi-hop wireless broadcast method called k-shortest path pruning (k-SPP). It is based on the dominant pruning method of Lim and Kim, and improves upon it in the context of certain routing protocols, such as the zone routing protocol. In this approach, every node must maintain as awareness of its k-hop neighbourhood, for some constant k ? 3. k-SPP dynamically discovers and exclusively uses forwarding paths having the property that every subpath of length k + 1 connects vertices that are a graph-theoretic distance k + 1 apart in the network graph. Experimental results demonstrate that k-SPP requires fewer transmissions than dominant pruning broadcasting. A new pruning method for efficient broadcasting in ad hoc networks
Michael Q. Rieck; Subhankar Dhar
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 209 - 217
This paper proposes a new multi-hop wireless broadcast method called k-shortest path pruning (k-SPP). It is based on the dominant pruning method of Lim and Kim, and improves upon it in the context of certain routing protocols, such as the zone routing protocol. In this approach, every node must maintain as awareness of its k-hop neighbourhood, for some constant k ? 3. k-SPP dynamically discovers and exclusively uses forwarding paths having the property that every subpath of length k + 1 connects vertices that are a graph-theoretic distance k + 1 apart in the network graph. Experimental results demonstrate that k-SPP requires fewer transmissions than dominant pruning broadcasting.

]]> 10.1504/IJMNDI.2011.042562 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 209 - 217 Michael Q. Rieck; Subhankar Dhar Drake University, Des Moines, IA, 50311, USA. ' San José State University, San José, CA, 95192, USA broadcast efficiency flooding pruning ad hoc networks routing protocols broadcasting. 2011-09-17T23:20:50-05:00 3 4 209 217 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42563 In this paper, a new resource allocation algorithm for the wireless communication systems coupled with multiple transmit receive antennas and orthogonal frequency-division multiplexing (OFDM) is proposed. To transform the MIMO channel into parallel eigenmode subchannels for each subcarrier, the base station (BS) employs singular value decomposition (SVD) based on channel state information (CSI). In order to maximise the system throughput with a limited power for the target BER, the proposed algorithm assigns the subcarrier to user that has the maximum Euclidean norm of the vector composed of the gains of all spatial subchannels on each subcarrier. After subcarrier-assigning, the Lagrange method is used to obtain an optimal power distribution. Simulation results show that the proposed algorithm gives significant improvement in maximisation of the system throughput. Resource allocation algorithm for multi-user MIMO-OFDM systems for high throughput WLAN
Habib Ayad; Khalid El Baamrani; Abdellah Ait Ouahman
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 218 - 223
In this paper, a new resource allocation algorithm for the wireless communication systems coupled with multiple transmit receive antennas and orthogonal frequency-division multiplexing (OFDM) is proposed. To transform the MIMO channel into parallel eigenmode subchannels for each subcarrier, the base station (BS) employs singular value decomposition (SVD) based on channel state information (CSI). In order to maximise the system throughput with a limited power for the target BER, the proposed algorithm assigns the subcarrier to user that has the maximum Euclidean norm of the vector composed of the gains of all spatial subchannels on each subcarrier. After subcarrier-assigning, the Lagrange method is used to obtain an optimal power distribution. Simulation results show that the proposed algorithm gives significant improvement in maximisation of the system throughput.

]]> 10.1504/IJMNDI.2011.042563 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 218 - 223 Habib Ayad; Khalid El Baamrani; Abdellah Ait Ouahman Team Telecommunication and Computer Networks, Faculty of Science Semlalia, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco. ' Department of Telecommunications, ENSA of Marrakech, University Cadi Ayyad, P.O. Box 575, Marrakech, Morocco. ' Team Telecommunication and Computer Networks, Faculty of Science Semlalia, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco resource allocation multi-user MIMO-OFDM singular value decomposition SVD Lagrange method WLAN wireless LANs local area networks wireless communications channel state information system throughput optimal power distribution optimisation. 2011-09-17T23:20:50-05:00 3 4 218 223 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42564 In this paper, a new approach based on ordinary kriging is proposed to predict network coverage in wireless local area networks. The proposed approach aims to reduce the cost of active site surveys by estimating path loss at points where no measurement data is available using samples taken at other points. To include the effect of obstacles on the covariance among points, a distance measure is developed based on an empirical path loss model. The proposed approach is tested in a simulated wireless local area network. The results show that ordinary kriging is able to estimate path loss with acceptable error levels. Predicting coverage in wireless local area networks with obstacles using kriging and neural networks
Abdullah Konak
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 224 - 230
In this paper, a new approach based on ordinary kriging is proposed to predict network coverage in wireless local area networks. The proposed approach aims to reduce the cost of active site surveys by estimating path loss at points where no measurement data is available using samples taken at other points. To include the effect of obstacles on the covariance among points, a distance measure is developed based on an empirical path loss model. The proposed approach is tested in a simulated wireless local area network. The results show that ordinary kriging is able to estimate path loss with acceptable error levels.

]]> 10.1504/IJMNDI.2011.042564 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 224 - 230 Abdullah Konak Information Sciences and Technology, Penn State Berks, Tulpehocken Road, P.O. Box 7009, Reading, PA 19610-6009, USA wireless LANs WLANs local area networks kriging signal estimation neural networks coverage planning mobile network design simulation path loss error levels. 2011-09-17T23:20:50-05:00 3 4 224 230 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42565 This paper explores the problem of bandwidth underutilisation in WSN, and evaluates the guaranteed time slot (GTS) mechanism performance using OPNET™. Time-critical applications for WSNs are an important class of services supported by the IEEE 802.15.4 standard. The IEEE 802.15.4 standard grants exclusive use of a wireless channel for time-critical traffic through GTS medium access control (MAC) mechanism. The GTS is activated in the beacon-enabled mode based on the superframe structure. A node has to use at least one whole GTS in a transmission. However, each node may not fully utilise its transmission capacity in a particular time slot if the packet arrival rate is too small. Hence, bandwidth utilisation is reduced. Queue management and buffer dimensioning at the nodes becomes an important factor to quantify the optimal parameters to tune the network for a better performance without making any modifications to the existing protocol. Analysis of buffer size dimensioning in GTS enabled IEEE 802.15.4 WSN for real-time applications
M.N. Hassan; Robert Stewart
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 231 - 238
This paper explores the problem of bandwidth underutilisation in WSN, and evaluates the guaranteed time slot (GTS) mechanism performance using OPNET™. Time-critical applications for WSNs are an important class of services supported by the IEEE 802.15.4 standard. The IEEE 802.15.4 standard grants exclusive use of a wireless channel for time-critical traffic through GTS medium access control (MAC) mechanism. The GTS is activated in the beacon-enabled mode based on the superframe structure. A node has to use at least one whole GTS in a transmission. However, each node may not fully utilise its transmission capacity in a particular time slot if the packet arrival rate is too small. Hence, bandwidth utilisation is reduced. Queue management and buffer dimensioning at the nodes becomes an important factor to quantify the optimal parameters to tune the network for a better performance without making any modifications to the existing protocol.

]]> 10.1504/IJMNDI.2011.042565 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 231 - 238 M.N. Hassan; Robert Stewart Athone Institute of Technology, Dublin Road, Athlone, Co. Westmeath, Ireland. ' Athone Institute of Technology, Dublin Road, Athlone, Co. Westmeath, Ireland wireless sensor networks WSNs IEEE 802.15.4 guaranteed time slot GTS MAC medium access control optimisation queuing theory real-time applications wireless networks bandwidth underutilisation bandwidth utilisation queue management buffer dimensioning. 2011-09-17T23:20:50-05:00 3 4 231 238 2011-09-17T23:20:50-05:00 http://www.inderscience.com/link.php?id=42566 With increasing deployment and use of wireless networks and the emerging mobile applications with transactions, there is a need to support quality of service for mobile transactions. As part of a QoS framework, two approaches for managing quality of service for mobile transactions are presented in this paper. More specifically, these allow for prioritised allocation of resources and borrowing of bandwidth from connections not utilising the allocated resources. The work is easily applied to both unicast and multicast (group) transactions. The performance evaluation of proposed approaches and a comparison with existing simple first come first serve approach will be presented in a subsequent paper. Novel resource allocation methods to support transaction level quality of service for mobile applications
Punit Ahluwalia; Upkar Varshney
International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 239 - 246
With increasing deployment and use of wireless networks and the emerging mobile applications with transactions, there is a need to support quality of service for mobile transactions. As part of a QoS framework, two approaches for managing quality of service for mobile transactions are presented in this paper. More specifically, these allow for prioritised allocation of resources and borrowing of bandwidth from connections not utilising the allocated resources. The work is easily applied to both unicast and multicast (group) transactions. The performance evaluation of proposed approaches and a comparison with existing simple first come first serve approach will be presented in a subsequent paper.

]]> 10.1504/IJMNDI.2011.042566 International Journal of Mobile Network Design and Innovation, Vol. 3, No. 4 (2011) pp. 239 - 246 Punit Ahluwalia; Upkar Varshney Department of Computer Information Systems, The University of Texas-Pan American, Edinburg, TX-78541, USA. ' Department of Computer Information Systems, Georgia State University, Atlanta, GA-30303, USA transaction level quality quality of service QoS bandwidth allocation methods connection borrowing mobile applications resource allocation wireless networks. 2011-09-17T23:20:50-05:00 3 4 239 246 2011-09-17T23:20:50-05:00