Proposed optimal LSP selection method in MPLS networks

 Shin-ichi Kuribayashi

1Department of Computer and Information Science, Seikei University, Japan 

Abstract 

Multi-Protocol Label Switching (MPLS) had been deployed by many data networking service providers including the next-generation mobile backhaul networks, because of its undeniable potential in terms of virtual private network (VPN) management, traffic engineering, etc. In MPLS networks, IP packets are transmitted along a Label Switched Path (LSP) established between edge nodes. To improve the efficiency of resource use in MPLS networks, it is essential to utilize the LSPs efficiently. This paper proposes a method of selecting the optimal LSP pair from among multiple LSP pairs which are established between the same pair of edge nodes, on the assumption that both the upward and downward LSPs are established as a pair (both-way operation). It is supposed that both upward and downward bandwidths are allocated simultaneously in the selected LSP pair for each service request. It is demonstrated by simulation evaluations that the proposal method could reduce the total amount of the bandwidth required by up to 15% compared with the conventional selection method. The proposed method can also reuse the know-how and management tools in many existing networks which are based on both-way operation. 

Keywords 

MPLS network, LSP selection, both-way operation 

More Details.....

AN EFFICIENT MAC PROTOCOL BASED ON HYBRID SUPERFRAME FOR WIRELESS SENSOR NETWORKS

 Ge Ma and Dongyu Qiu 

Department of Electrical and Computer Engineering Concordia University, Montreal, QC, Canada 

 ABSTRACT

 Designing low energy consumption, high efficiency Media Access Control (MAC) protocols are one of the most important directions in wireless sensor networks (WSN). In this paper, we proposed a new contention reserve MAC protocol, named CRMAC, under the inspiration of IEEE 802.15.4’s superframe structure. CRMAC is a MAC protocol suitable for intra-cluster WSN that combines the advantages of contention and schedule-based MAC protocols. We introduce the mechanism and superframe structure of CRMAC in detail and verified the performance of this protocol through simulations. Our results show that CRMAC performs better than IEEE 802.15.4 in energy consumption, system delay and network throughput. CRMAC is especially suitable for short packet transmission under low load networks, which is the main situation in WSN.

 KEYWORDS 

WSN, MAC, CRMAC, Superframe


More Details...

RFID LOCALISATION FOR INTERNET OF THINGS SMART HOMES: A SURVEY

Belal Alsinglawi1 , Mahmoud Elkhodr1 , Quang Vinh Nguyen1, 2 and Upul Gunawardana1 , Anthony Maeder3 and Simeon Simoff1,2

 1 School of Computing, Mathematics and Engineering, Western Sydney University, Sydney, Australia 2MARCS Institute, Western Sydney University, Sydney, Australia 3 School of Health Science, Flinders University, Adelaide, Australia 

ABSTRACT

 The Internet of Things (IoT) enables numerous business opportunities in fields as diverse as e-health, smart cities, smart homes, among many others. The IoT incorporates multiple long-range, short-range, and personal area wireless networks and technologies into the designs of IoT applications. Localisation in indoor positioning systems plays an important role in the IoT. Location Based IoT applications range from tracking objects and people in real-time, assets management, agriculture, assisted monitoring technologies for healthcare, and smart homes, to name a few. Radio Frequency based systems for indoor positioning such as Radio Frequency Identification (RFID) is a key enabler technology for the IoT due to its costeffective, high readability rates, automatic identification and, importantly, its energy efficiency characteristic. This paper reviews the state-of-the-art RFID technologies in IoT Smart Homes applications. It presents several comparable studies of RFID based projects in smart homes and discusses the applications, techniques, algorithms, and challenges of adopting RFID technologies in IoT smart home systems.

 KEYWORDS 

Smart Homes, Indoor Positioning, Localisation, Internet of Things & RFID


More Details....

Bounds on the Achievable Rates of Faded Dirty Paper Channel

 Zouhair Al-qudah1 , Wael Abu Shehab2 

1Department of Communication Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan 2Department of Electrical Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan

 ABSTRACT 

Bounds on the achievable rate of a Gaussian channel in the case that the transmitter knows the interference signal but not its fading coefficients are given. We generalize the analysis which were studied in many other references such that their results are special cases of our analysis. We enforce our bounds by simulations in which many numerical examples are drawn and investigated under different cases. 

KEYWORDS 

Dirty paper coding, lattice encoding and decoding, fading channel, Viterbi Algorithm. 

More Details....

POSITION BASED ADAPTIVE ROUTING FOR VANETS

 Ajay Guleria and Kuldeep Singh 

1Computer Centre, Panjab University, Chandigarh, India 2Computer Science & Application Department, Panjab University, Chandigarh, India

 ABSTRACT

 Routing plays a very significant role in multi hop data dissemination in Vehicular Ad-Hoc Networks (VANETs). Wehave proposed a Position based Adaptive Routing (PAR) protocol which is scalable for different network densities in VANETs. This scheme uses Preferred Group Broadcasting (PGB) for route discovery. In this mode, after broadcasting the request for route discovery the source node starts listening to the channel. If the packet is not further rebroadcasted by any neighbor in a set timeout, then it repeats the broadcast. This process is repeated until the request reaches the destination. The destination keeps on accumulating route requests coming from different paths until predefined time. It then chooses the least cost path as route reply. It uses the set of traversed anchors for sending the unicast route reply to the source node. PAR uses Advance Greedy Forwarding (AGF) for data forwarding and greedily forwards the data packet to the next anchor towards destination node. It switches to carry and forward mode once it finds partitions in the network. The intermediate vehicle buffers the packet until next junction and switches back to position based scheme and greedily forwards to next node in range which is closest to the destination. To have an end to end connectedpath, it uses guards to guard anchors tied to different junction and geographical locations in the network. The algorithm is scalable and exploits advantages of existing techniques already developed for specific scenarios in VANET. Results show that the service ratio and packet delay of PAR are higher than its counterparts. 

KEYWORDS 

PAR, PGB, AGF

More Details....

ANALYTICAL STUDY FOR MEASURING THE ELECTROMAGNETIC RADIATION OF THE GSM SYSTEM IN URBAN AREAS

Murad A.A.Almekhlafi 

Department of Electrical Engineering – Division Communication Engineering, Sana’a University- Faculty of Engineering, Sana’a, Yemen. 

 ABSTRACT 

This paper discusses three subjects. In the first section Study And Evaluation Of Mobile Network While in the second section, Radiated Power Density ability of cellular stations. In the third section compare the results with the International Standards and safety limits recommended by the ICNIRP to ensure compliance with the terms and the extent of their impact on human health, on the other hand, through the results of theoretical analysis and benchmark Mathematical Analysis And Practical Measurement. 

KEYWORDS 

Electromagnetic Radiation;Global System for Mobile communications (GSM) ;Code;Urban area; Measurement;Received Power; Radiation pattern ;Power Density;Equipment Spectrum Analyzer. 

More Details........ 

FAULT TOLERANT ROUTING ALGORITHM IN OCTAGON-CELL INTERCONNECTED NETWORK FOR HORIZONTAL MOVING MESSAGES

Sanjukta Mohanty and Prafulla Ku. Behera

1North Orissa University, Sriram Chandra Vihar, Takatpur, Baripada, Odisha, India

 2Utkal University, Vani Vihar, Bhubaneswar, Odisha, India

 ABSTRACT

Octagon-Cell interconnected network can be viewed as an undirected graph, in which vertices and edges can be compared with processors and bidirectional communication links respectively between the processing elements. It has attractive features like small diameter and better bisection width and constant node degree. It is analyzed to arrive at fault-tolerant communication. A fault tolerant communication scheme for this network is described in this paper. Here an efficient routing scheme has been described which routes the horizontal moving messages from source node to the destination node in presence of faulty nodes / link failure along the path. In this algorithm when a message is received by an intermediate node, it will consider itself a new source node. 

KEYWORDS 

 Interconnected networks, Octagon-cell, Routing Algorithm, Network services 

More Details... 

Singular Value Decomposition: Principles and Applications in Multiple Input Multiple Output Communication system

 Wael Abu Shehab1 and Zouhair Al-qudah2

 1Department of Electrical Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan 2Department of Communication Engineering, Al-Hussein Bin Talal University, Ma’an, Jordan 

ABSTRACT 

The authors discuss the importance of using the singular value decomposition (SVD) in computing the capacity of multiple input multiple output (MIMO) and in estimation the channel gain from the transmitter to the receiver. Examples that show how the SVD simplifies computing the MIMO channel capacity are discussed. Numerical results that show what factors determine the performance of using SVD in channel estimation are also discussed

More Details....