ANALYZING AND SCALING THE PERFORMANCE OF MOBILE DATA COMMUNICATION WITH MIXED COOPERATIVE AND NON-COOPERATIVE NODES BASED

ON SOCIAL CONTRACT
1

M. Subha and 2G.Ruckumani

Assistant Professor, Department of Computer Science, Vellalar College for Women (Autonomous), Erode, Tamil Nadu, 638 012, India.

Assistant Professor, Department of Computer Science, Maharaja Co-Education Arts and Science College, Perundurai Tamil Nadu, 638052.
1 2

E-mail: subha_sangeeth@rediffmail.com. E-mail: ruckumani@gmail.com.

ABSTRACT

Non-cooperation is the main drawback in the mobile info-station network especially during file exchange. In the existing communication model, particularly in the commercial applications are having the minimum density of nodes in that, some nodes keep non-cooperation during exchange of file. So to ensure proper communication, the proposed partial interest model properly assimilates the nodes and solves the problem by using opportunistic cooperation technique based on social contract. The proposed research work analyzed and shows the performance of throughput and delay with mobility and number of nodes in various ratios of cooperative and non-cooperative nodes in the network. Keywords: Mobile info-station network, opportunistic cooperation, partial interest model, social contract.

1. INTRODUCTION In mobile info-station network, each node either downloads files from an info-station or exchanges files with a neighbor. At the info-station, only file downloading is allowed. At any other locations, file exchanges between mobile nodes are permitted [1]. Multi-user diversities and data diversities exist in the network. In commercial applications nodes are not cooperate to exchange files from one node to another node [5 & 6]. All nodes are not interest in the communication. Some nodes are not cooperating to exchange files. So performance of network degraded [5 & 6]. The proposed research work describes noncooperation in the partial interest model and analyzes the node density, traffic, data loss, throughout to compare the performance of network. 2 EXISTING TECHNIQUES In existing techniques the following two models are applied. Common interest model Dissimilar interest model

First, in the existing techniques nodes are all cooperative or all are non-cooperative. Second, the existing technique is applied only for maximum 25 nodes in the network. So the network performance like throughput and delay are affected especially in node mobility and the density of nodes varies [2, 3 & 4]. Hence the proposed research work introduces a new model named partial interest model which has both cooperative and as well as non-cooperative nodes in the network during the exchange of files. The non-cooperative nodes in the path are used for file exchange by using opportunistic cooperation technique in node mobility for 50 nodes. 3 PROPOSED RESEARCH METHODOLOGY The proposed research methodology is based on the following three subdivisions. 3.1 Partial Interest Model In partial interest model all non-cooperative nodes in the path are not interested to exchange the content with the neighbor node in the network. Only the co-operative nodes in the path are interested to exchange the files. Hence the nodes are partially interested in the network during file exchange. But in the partial interest model, the all non-cooperative node in the path are made to be involved for file exchange by applying social contract and using opportunistic cooperation technique. 3.2 Social Contract The non-cooperative nodes in the path are made to involve for file exchange by

In common interest model, all nodes are interest to exchange all files in the network. In mobile info-station network, all nodes are fully cooperated. Particularly in the commercial applications sometimes very few nodes become non-cooperate to exchange files [5 & 6]. In the dissimilar interest model all nodes are non-cooperate to exchange files from one to another node. In entire network all nodes are non-cooperative.

applying social contract between the cooperative and non-cooperative nodes in the path. The cooperative node inspects and interchanges the file contents with the noncooperative node in the path is said to be Social Contract. The each cooperative node in the path will identify the file that it needs which was available in the noncooperative node by using social contract and bilateral file exchange is occurred. 3.3 Opportunistic Cooperation Technique The proposed research work creates opportunistic cooperation between cooperative and non-cooperative nodes in the network for file exchange. In the mobile info-station network, some times nodes have partial interest to exchange files. So the proposed partial interest model creates opportunistic cooperation between the nodes. The opportunistic cooperation aligns the node in the path those who have partial interest in the file exchanging process. Then each node met and inspected each other to exchange needed files based on social contract. Hence the nodes exchanged the files with the help of opportunistic cooperation. 4 RESULT AND DISCUSSIONS

PARAMETER Simulation tool Environment Size Simulation Time Number of Nodes speed Protocol Applied Performance Metrics

VALUE NS-2.34 980m * 660 m 20s 50 10m/s DSR Throughput, Delay, Packet loss in mobility Density of nodes.

Table 1 Network Parameters The Table 1 shows the parameter of the network environment in which the proposed system is simulated. 4.1 Performance of Throughput The throughput of the network is improved in the proposed research work. Also the improvement is shown for the different ratios of cooperative and non-cooperative nodes in the network for 50 nodes. 4.1.1 Performance of Throughput in Mobility

In 30:70 (cooperative nodes: noncooperative nodes) throughput result is very 3

low. In 50:50 (cooperative nodes: noncooperative nodes) the throughput is better than 30:70. In 70:30 (cooperative nodes: non-cooperative nodes) throughput is high. The Fig. 4.1.1 shows the result of Mobility vs. Throughput for various ratios.

In 30:70 (cooperative nodes: noncooperative nodes) throughput result is very low. In 50:50 (cooperative nodes: noncooperative nodes) throughput is better than 30:70. In 70:30 (cooperative nodes: noncooperative nodes) throughput is high. The Fig. 4.1.2 shows the result of throughput for varies ratios with 50 nodes.

Figure 4.1.1 Performance of Throughput in node mobility 4.1.2 Performance of Throughput for 50 Nodes In the existing system only the 25 nodes are at maximum in the network. If nodes increase then the network performance decreased in the existing work. In the proposed research work, the network performance throughput increased for maximum 50 nodes in the network.

Figure 4.1.2 Performance of throughput for 50 nodes

Hence the result shows the performance of throughput is high which has been analyzed with Mobility for 50 nodes in varies ratios 30:70, 50:50 and 70:30 cooperative and noncooperative nodes in the proposed system. 4.2 Performance of Delay 4.2.1 Performance of Delay in Mobility

In 30:70 (cooperative nodes: noncooperative nodes) delay is very high. In 50:50 (cooperative nodes: non-cooperative nodes) delay is better than 30:70. In 70:30 (cooperative node: non-cooperative nodes) delay is reduced. The Fig. 4.2.1 shows the result of delay in node mobility for varies ratios like 30:70, 50:50 and 70:30 cooperative nodes and non-cooperative nodes in the proposed system.

result of delay with 50 nodes in the network for various ratios. Figure 4.2.2 Performance of delay for 50 Nodes Hence the performance of delay is analyzed with Mobility with 50 nodes with varies ratios like 30:70, 50:50, 70:30 cooperative and non-cooperative node in the proposed work. 4.3 Comparative Study The Table 2 shows the performance of through put and delays for each different ratio with mobility and number of 50 nodes in the network.

Perfo rman ce metri cs

Throughput

Delay

Ratios Mobility

No.of Nodes (50 nodes) Slow Medium High

Mobility

No. of. Nodes (50 nodes) High Reduc ed Reduc ed

Figure 4.2.1 Performance of delay in mobility 4.1.2 Performance of Delay for 50 Nodes

30:70 50:50 70:3 0

Slow Medium High

High Reduced Reduced

In 30:70 (cooperative nodes: noncooperative nodes) delay is high. In 50:50 (cooperative nodes: non-cooperative nodes) delay is better than 30:70. In 70:30 (cooperative nodes: non-cooperative nodes) delay is reduced. The Fig. 4.2.2 shows the

Table 2: Comparative Study of performance metrics of different ratios 5 CONCLUSION The proposed research work improves the performance of the mobile info-station network which is shown by simulated in the NS-2 tool. The proposed system introduces the partial interest model which has the both cooperative and non-cooperative nodes but the files in the non-cooperative node are exchanged by applying social contract between cooperative and non-cooperative

nodes and using opportunistic cooperation technique. The performance metrics like throughput and delay are analyzed and the better results are shown through simulation.

[5] Wing Ho Yuen, Siun-Chuon Mau, and Roy D. Yates Existence of Data and Multiuser Diversities in Noncooperative Mobile Infostation Networks this paper appears on IEEE transactions on mobile computing, vol. 8, no. 8, august (2009). [6] Wing Ho Yuen; Yates, R.D.; SiunChuon Mau; WINLAB, Rutgers Univ., New Brunswick, NJ, USA Noncooperative content distribution in mobile infostation networks , IEEE March (2003). ABOUT THE AUTHORS 1. M. Subha M. Subha was born on 24 01 1976, she received the B.Sc. (Computer Science), M.C.A., and M.Phil, degree in Computer Science from the Bharathiar University, Coimbatore in 1996, 2003 and 2006 respectively. She was submitted the Ph. D. thesis on Dec 2010. She is a Assistant Professor in the Department of Computer Science, Vellalar College for Women (Autonomous), Erode since 2004. Totally she has eight years teaching experiences. She published two papers in International Journals and a paper in National Journal. Also she was presented more than ten papers in the International, National conferences and Seminars. Her research interests include wired and wireless networks (MANET) with focus on Routing, Security and Intrusion Detection. 2. G. Ruckumani

6 FUTURE WORKS The security concept may apply while applying social contract between cooperative and non-cooperative nodes. Intrusion and detection in the partial interest model can also be analyzed in future. The various lengths of bytes and types of files may be considered and analyzed for file exchange between the nodes in the proposed system. 7 REFERENCES [1] R. H Frenkiel, B.R Badrinath, J.Borres, R.D Yates. Wireless Inf. Network Lab., Rutgers Univ., Piscataway, NJ The Infostations challenge: balancing cost and ubiquity in delivering wireless data, volume: 7, issue-2 issue date Apr (2000). [2] M. Grossglauser, D.N C Tse; AT&T Labs-Res., Florham Park, NJ. Mobility increases the capacity of ad-hoc wireless networks, Volume 10 August (2002). [3] Liang-Liang Xie, P.R. Kumar, Inst. of Syst. Sci., Chinese Acad. of Sci., Beijing, China. A network information theory for wireless communication: scaling laws and optimal operation, May 2004 Volume: 50 May (2004). [4] M.J. Neely, E. Modiano, Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA. Capacity and delay tradeoffs for ad hoc mobile networks, Volume: 51, June (2005).

G.Ruckumani was born on 28-7-1983, she received the B. Sc (Computer Science), M.Sc (Computer Communication) degree in Computer Science from the Bharathiar University, Coimbatore in 2003 and 2005

respectively. She is a Lecturer in the Department of Computer Science, Maharaja

Co-Education Arts Perundurai since 2008.

and

Science,