Mahmoud Daneshmand | Stevens Institute of Technology (original) (raw)

Papers by Mahmoud Daneshmand

Advanced in Optical Network Control and Management

Journal of Network and Systems Management, 2012

Error recovery based on FEC in network-layer for Intermittently Connected Mobile Networks

Proceedings of the 5th International ICST Conference on Communications and Networking in China, 2010

ABSTRACT Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challengi... more ABSTRACT Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and destination can not be sustained in ICMNs. To reliably hand over data to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packet. In this paper, we propose a novel Network layer Error Recovery method based on FEC, named NER. NER divides a data packet into RS blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. The simulation results show that NER can obviously increase the delivery-ratio in ICMNs.

Relay selection considering MAC overhead and collision in wireless networks

2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

ABSTRACT In this paper, we propose a relay selection method, Maximum Throughput Relay Selection A... more ABSTRACT In this paper, we propose a relay selection method, Maximum Throughput Relay Selection Algorithm (MTRSA) for wireless networks. Based on the derivation of direct and cooperative communications, MTRSA takes both MAC overhead and collision into consideration for maximizing the system throughput. In addition, the analytical derivation and proposed relay selection algorithm support both amplify-and-forward (AF) and decode-and-forward (DF). Numerical results and simulations are provided to validate the efficiency of our algorithm.

Statistical characteristics of wireless link in opportunistic networks

2012 IEEE Global Communications Conference (GLOBECOM), 2012

ABSTRACT Opportunistic network is a type of challenged network where an end-to-end path between t... more ABSTRACT Opportunistic network is a type of challenged network where an end-to-end path between the source and the destination doesn't exist. The dissemination of the data relies on the encounters of nodes. Link duration time is a main factor in determining the transmission capacity between two encounter nodes in the opportunistic network. Besides, inter-contact time plays a key role in forwarding algorithms and has an obvious effect on the delivery delay. In this paper, according to statistical analysis and numerical methods, statistical characteristics of wireless link in random waypoint (RWP) are analyzed from aspects of contact duration time and inter-contact time with different moving speed and transmission radiuses of the nodes. Complementary Cumulative Distribution Functions (CCDF) of the contact duration time and inter-contact time of the nodes are provided by numerical methods.

A novel bargaining based incentive protocol for opportunistic networks

2012 IEEE Global Communications Conference (GLOBECOM), 2012

ABSTRACT Opportunistic networks are the emerging networks featured by partitions, long disconnect... more ABSTRACT Opportunistic networks are the emerging networks featured by partitions, long disconnections, and topology instability, where the message propagation depends on the cooperation of nodes to fulfill a “store-carry-and-forward” fashion. But due to constrained energy and buffer, some nodes may behave selfishly, which will involve damage to the existing routing approaches and seriously degrade the performance of opportunistic networks. Aiming at the above problem, this paper proposes a novel bargaining based incentive protocol (BIP) for opportunistic networks, which exploits two-person bargaining model and allows a node to pay and charge according to its state and the attributes of messages. In addition, the proposed BIP protocol can tackle the issue of blind cooperation when the resources are very scarce. Extensive simulation results demonstrate the effectiveness and the practicality of the proposed BIP protocol in terms of high delivery ratio, low energy consumption and small average delay.

Ten years of experimentation in Information Mining & Software Research with applications in telecommunications industry

2008 IEEE Symposium on Computers and Communications, 2008

ABSTRACT Not Available

Mobile Networks and Applications, 2011

To improve the spectrum utilization, more and more attention was paid to OFDM based opportunistic... more To improve the spectrum utilization, more and more attention was paid to OFDM based opportunistic spectrum access (OSA) systems in recent years. In this paper, to enable coexistence between a secondary user and a primary user, a novel method called EAIC was proposed for spectral sculpting of OFDM signal effectively. In EAIC, however, the cancellation signals cause self-interferences to OFDM data tones so that the symbol-error-rate (SER) performance was degraded especially in high order modulation such as 64 QAM. In this paper, a new method called EAIC with self-interference constraint (EAIC-IC) is proposed, in which we analyze the interferences caused by cancellation signals, and then formulate an optimization problem to minimize both the total sidelobe power and the selfinterferences. Simulation results show that the EAIC-IC method can provide a perfect tradeoff between spectrum notch depth and SER performance via adjusting the value of the constraint parameter.

Journal of Network and Systems Management, 2012

IEEE Sensors Journal, 2000

Chonggang Wang received the Ph.D. degree from the Beijing University of Posts and Telecommunicati... more Chonggang Wang received the Ph.D. degree from the Beijing University of Posts and Telecommunications, Beijing, China, in 2002. He is currently with InterDigital Communications with focuses on Internet of Things research and development activities, including technology development and standardization. He has co-authored more than 100 journal/conference articles and book chapters. He is on the editorial board for several journals, including the IEEE Communications Magazine, the IEEE Wireless Communications Magazine, and the IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. He has organized and is coorganizing several special issues respectively for the IEEE SENSORS JOURNAL, the IEEE JSAC, the IEEE Network Magazine, the IEEE Communications Magazine, and the IEEE Communications Surveys and Tutorials. He is the Vice-Chair of the IEEE ComSoc Multimedia Technical Committee.

2008 International Conference on Telecommunications and Workshop, ICT 2008 and MACOM 2008 Workshop Proceedings

hh.se. Publications. ...

LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advant... more LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.

Multiple Ferry Routing for the Opportunistic Networks

In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed... more In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed because of intermittent connection in the opportunistic network, it is desirable to employ a special node called ferry, which moves in a specific trace and forwards data for disconnected nodes, to provide communication opportunities. In this paper, Global Ferry Scheme (GFS), which exploits multiple local ferries and a global ferry to deliver messages, is proposed to minimize the average message delivery delay. The performance of GFS is evaluated and compared to the existing ferry-based routing method by analysis and simulation. The results show that GFS can improve the performance of opportunistic networks in terms of average delay and delivery ratio.

Framework and requirements of Quality of Service for multimedia applications

The authors introduce a comprehensive framework for identification, definition and quantification... more The authors introduce a comprehensive framework for identification, definition and quantification of Quality of Service (QOS) parameters for multimedia applications. The framework covers several aspects of QOS for multimedia applications. They have categorized multimedia applications considering key attributes of networking and communication mode, and have specified major QOS parameters and requirements within each categories. They have partitioned the end-to-end networking

Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 26-29 June 2006, Cagliari, Sardinia, Italy

A Cooperative Relay Method and Performance for Wireless Networks

ABSTRACT In cooperative relay system, relay nodes forward traffic will cause an increase of netwo... more ABSTRACT In cooperative relay system, relay nodes forward traffic will cause an increase of network loads, which will affect the system throughput. However, most existing cooperative schemes do not consider the impact of the network loads. In this paper, we propose a novel cooperative relay method called Cooperative communication based on offered load (CCBOL) for wireless networks, in which the relay method is the IEEE 802.11 DCF (Distribution Coordination Function) scheme. In CCBOL, we introduce the offered load to analyze the throughput performance for the proposed cooperative relay system. We utilize throughput performance as a metric to decide whether cooperation is adopted. The analysis and simulation results show that CCBOL can significantly improve the throughput comparing with the existing direct communication under some offered load networks.

Keynote 1: Intelligent Network Operations and Management — It's about the data

Intelligent Operations and Management, in general, and, Intelligent Network Operations and Manage... more Intelligent Operations and Management, in general, and, Intelligent Network Operations and Management, in particular, is increasingly about End-to-End control across multiple networks/services; across multiple layers in network, computing, and software stacks; and, across a variety of time-frames. It is, therefore, a problem of integration and analysis of huge amounts of very heterogeneous data in real time. This talk will contain an overview of AT&T Shannon Labs research, and a discussion of our work in Information Mining and Software Research with applications in telecommunications industry including network operations, network security, IP network management, fraud detection, marketing, and business & consumer markets analysis. The emphasis will be on near real-time analysis and mining of large scale data streams. Selected future research direction will be presented.

IEEE Journal on Selected Areas in Communications, 2007

Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive e... more Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive energy consumption. Therefore congestion in WSNs needs to be controlled in order to prolong system lifetime. In addition, this is also necessary to improve fairness and provide better quality of service (QoS), which is required by multimedia applications in wireless multimedia sensor networks. In this paper, we propose a novel upstream congestion control protocol for WSNs, called priority-based congestion control protocol (PCCP). Unlike existing work, PCCP innovatively measures congestion degree as the ratio of packet inter-arrival time along over packet service time. PCCP still introduced node priority index to reflect the importance of each sensor node. Based on the introduced congestion degree and node priority index, PCCP utilizes a cross-layer optimization and imposes a hop-by-hop approach to control congestion. We have demonstrated that PCCP achieves efficient congestion control and flexible weighted fairness for both single-path and multi-path routing, as a result this leads to higher energy efficiency and better QoS in terms of both packet loss rate and delay.

Mobile Networks and Applications

Measuring outages in telecommunications switched networks

IEEE Communications Magazine, 1993

ABSTRACT

IEEE Network, 2006

In this article we present an overview for transport protocols for Wireless Sensor Networks (WSNs... more In this article we present an overview for transport protocols for Wireless Sensor Networks (WSNs). We firstly highlight the unique aspects in WSNs, and describe the basic design criteria and challenges of transport protocols including energy-efficiency, quality of service, reliability, and congestion control. We then provide a summary and comparison of existing transport protocols for WSNs. Finally, we discuss several open problems.

Advanced in Optical Network Control and Management

Journal of Network and Systems Management, 2012

Error recovery based on FEC in network-layer for Intermittently Connected Mobile Networks

Proceedings of the 5th International ICST Conference on Communications and Networking in China, 2010

ABSTRACT Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challengi... more ABSTRACT Reliable transmission in Intermittently Connected Mobile Networks (ICMNs) is a challenging work because the effective and reliable connection between the source and destination can not be sustained in ICMNs. To reliably hand over data to the destination, many dissemination-based routing protocols are proposed. Dissemination-based routing protocols assure nodes including intermediate nodes and destinations have more chances to receive packets, which will increase the probability that the packets can be correctly received by the destination. However, the existing error recovery mechanisms in network layer use the simple CRC to check the data packets independently, and discard the error packets even if one correct packet can be obtained from more than one partly error packet. In this paper, we propose a novel Network layer Error Recovery method based on FEC, named NER. NER divides a data packet into RS blocks and insert redundancy to each block. So the intermediate nodes and destinations can recover a correct data packet from multiple partially error copies of the same packet. The simulation results show that NER can obviously increase the delivery-ratio in ICMNs.

Relay selection considering MAC overhead and collision in wireless networks

2013 IEEE Wireless Communications and Networking Conference (WCNC), 2013

ABSTRACT In this paper, we propose a relay selection method, Maximum Throughput Relay Selection A... more ABSTRACT In this paper, we propose a relay selection method, Maximum Throughput Relay Selection Algorithm (MTRSA) for wireless networks. Based on the derivation of direct and cooperative communications, MTRSA takes both MAC overhead and collision into consideration for maximizing the system throughput. In addition, the analytical derivation and proposed relay selection algorithm support both amplify-and-forward (AF) and decode-and-forward (DF). Numerical results and simulations are provided to validate the efficiency of our algorithm.

Statistical characteristics of wireless link in opportunistic networks

2012 IEEE Global Communications Conference (GLOBECOM), 2012

ABSTRACT Opportunistic network is a type of challenged network where an end-to-end path between t... more ABSTRACT Opportunistic network is a type of challenged network where an end-to-end path between the source and the destination doesn't exist. The dissemination of the data relies on the encounters of nodes. Link duration time is a main factor in determining the transmission capacity between two encounter nodes in the opportunistic network. Besides, inter-contact time plays a key role in forwarding algorithms and has an obvious effect on the delivery delay. In this paper, according to statistical analysis and numerical methods, statistical characteristics of wireless link in random waypoint (RWP) are analyzed from aspects of contact duration time and inter-contact time with different moving speed and transmission radiuses of the nodes. Complementary Cumulative Distribution Functions (CCDF) of the contact duration time and inter-contact time of the nodes are provided by numerical methods.

A novel bargaining based incentive protocol for opportunistic networks

2012 IEEE Global Communications Conference (GLOBECOM), 2012

ABSTRACT Opportunistic networks are the emerging networks featured by partitions, long disconnect... more ABSTRACT Opportunistic networks are the emerging networks featured by partitions, long disconnections, and topology instability, where the message propagation depends on the cooperation of nodes to fulfill a “store-carry-and-forward” fashion. But due to constrained energy and buffer, some nodes may behave selfishly, which will involve damage to the existing routing approaches and seriously degrade the performance of opportunistic networks. Aiming at the above problem, this paper proposes a novel bargaining based incentive protocol (BIP) for opportunistic networks, which exploits two-person bargaining model and allows a node to pay and charge according to its state and the attributes of messages. In addition, the proposed BIP protocol can tackle the issue of blind cooperation when the resources are very scarce. Extensive simulation results demonstrate the effectiveness and the practicality of the proposed BIP protocol in terms of high delivery ratio, low energy consumption and small average delay.

Ten years of experimentation in Information Mining & Software Research with applications in telecommunications industry

2008 IEEE Symposium on Computers and Communications, 2008

ABSTRACT Not Available

Mobile Networks and Applications, 2011

To improve the spectrum utilization, more and more attention was paid to OFDM based opportunistic... more To improve the spectrum utilization, more and more attention was paid to OFDM based opportunistic spectrum access (OSA) systems in recent years. In this paper, to enable coexistence between a secondary user and a primary user, a novel method called EAIC was proposed for spectral sculpting of OFDM signal effectively. In EAIC, however, the cancellation signals cause self-interferences to OFDM data tones so that the symbol-error-rate (SER) performance was degraded especially in high order modulation such as 64 QAM. In this paper, a new method called EAIC with self-interference constraint (EAIC-IC) is proposed, in which we analyze the interferences caused by cancellation signals, and then formulate an optimization problem to minimize both the total sidelobe power and the selfinterferences. Simulation results show that the EAIC-IC method can provide a perfect tradeoff between spectrum notch depth and SER performance via adjusting the value of the constraint parameter.

Journal of Network and Systems Management, 2012

IEEE Sensors Journal, 2000

Chonggang Wang received the Ph.D. degree from the Beijing University of Posts and Telecommunicati... more Chonggang Wang received the Ph.D. degree from the Beijing University of Posts and Telecommunications, Beijing, China, in 2002. He is currently with InterDigital Communications with focuses on Internet of Things research and development activities, including technology development and standardization. He has co-authored more than 100 journal/conference articles and book chapters. He is on the editorial board for several journals, including the IEEE Communications Magazine, the IEEE Wireless Communications Magazine, and the IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT. He has organized and is coorganizing several special issues respectively for the IEEE SENSORS JOURNAL, the IEEE JSAC, the IEEE Network Magazine, the IEEE Communications Magazine, and the IEEE Communications Surveys and Tutorials. He is the Vice-Chair of the IEEE ComSoc Multimedia Technical Committee.

2008 International Conference on Telecommunications and Workshop, ICT 2008 and MACOM 2008 Workshop Proceedings

hh.se. Publications. ...

LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advant... more LEACH protocol is one of the clustering routing protocols in wireless sensor networks. The advantage of LEACH is that each node has the equal probability to be a cluster head, which makes the energy dissipation of each node be relatively balanced. In LEACH protocol, time is divided into many rounds, in each round, all the nodes contend to be cluster head according to a predefined criterion. This paper focuses on how to set the time length of each round, to prolong the lifetime of the network and increase throughput, which is denoted as the amount of data packs sent to the sink node. The functions of lifetime and throughput related to the time length of each round are deduced. These functions can be used to enhance the performance of cluster-based wireless sensor networks in terms of lifetime and throughput.

Multiple Ferry Routing for the Opportunistic Networks

In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed... more In order to overcome the phenomenon that the existence of end-to-end path is no longer guaranteed because of intermittent connection in the opportunistic network, it is desirable to employ a special node called ferry, which moves in a specific trace and forwards data for disconnected nodes, to provide communication opportunities. In this paper, Global Ferry Scheme (GFS), which exploits multiple local ferries and a global ferry to deliver messages, is proposed to minimize the average message delivery delay. The performance of GFS is evaluated and compared to the existing ferry-based routing method by analysis and simulation. The results show that GFS can improve the performance of opportunistic networks in terms of average delay and delivery ratio.

Framework and requirements of Quality of Service for multimedia applications

The authors introduce a comprehensive framework for identification, definition and quantification... more The authors introduce a comprehensive framework for identification, definition and quantification of Quality of Service (QOS) parameters for multimedia applications. The framework covers several aspects of QOS for multimedia applications. They have categorized multimedia applications considering key attributes of networking and communication mode, and have specified major QOS parameters and requirements within each categories. They have partitioned the end-to-end networking

Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 26-29 June 2006, Cagliari, Sardinia, Italy

A Cooperative Relay Method and Performance for Wireless Networks

ABSTRACT In cooperative relay system, relay nodes forward traffic will cause an increase of netwo... more ABSTRACT In cooperative relay system, relay nodes forward traffic will cause an increase of network loads, which will affect the system throughput. However, most existing cooperative schemes do not consider the impact of the network loads. In this paper, we propose a novel cooperative relay method called Cooperative communication based on offered load (CCBOL) for wireless networks, in which the relay method is the IEEE 802.11 DCF (Distribution Coordination Function) scheme. In CCBOL, we introduce the offered load to analyze the throughput performance for the proposed cooperative relay system. We utilize throughput performance as a metric to decide whether cooperation is adopted. The analysis and simulation results show that CCBOL can significantly improve the throughput comparing with the existing direct communication under some offered load networks.

Keynote 1: Intelligent Network Operations and Management — It's about the data

Intelligent Operations and Management, in general, and, Intelligent Network Operations and Manage... more Intelligent Operations and Management, in general, and, Intelligent Network Operations and Management, in particular, is increasingly about End-to-End control across multiple networks/services; across multiple layers in network, computing, and software stacks; and, across a variety of time-frames. It is, therefore, a problem of integration and analysis of huge amounts of very heterogeneous data in real time. This talk will contain an overview of AT&T Shannon Labs research, and a discussion of our work in Information Mining and Software Research with applications in telecommunications industry including network operations, network security, IP network management, fraud detection, marketing, and business & consumer markets analysis. The emphasis will be on near real-time analysis and mining of large scale data streams. Selected future research direction will be presented.

IEEE Journal on Selected Areas in Communications, 2007

Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive e... more Congestion in wireless sensor networks not only causes packet loss, but also leads to excessive energy consumption. Therefore congestion in WSNs needs to be controlled in order to prolong system lifetime. In addition, this is also necessary to improve fairness and provide better quality of service (QoS), which is required by multimedia applications in wireless multimedia sensor networks. In this paper, we propose a novel upstream congestion control protocol for WSNs, called priority-based congestion control protocol (PCCP). Unlike existing work, PCCP innovatively measures congestion degree as the ratio of packet inter-arrival time along over packet service time. PCCP still introduced node priority index to reflect the importance of each sensor node. Based on the introduced congestion degree and node priority index, PCCP utilizes a cross-layer optimization and imposes a hop-by-hop approach to control congestion. We have demonstrated that PCCP achieves efficient congestion control and flexible weighted fairness for both single-path and multi-path routing, as a result this leads to higher energy efficiency and better QoS in terms of both packet loss rate and delay.

Mobile Networks and Applications

Measuring outages in telecommunications switched networks

IEEE Communications Magazine, 1993

ABSTRACT

IEEE Network, 2006

In this article we present an overview for transport protocols for Wireless Sensor Networks (WSNs... more In this article we present an overview for transport protocols for Wireless Sensor Networks (WSNs). We firstly highlight the unique aspects in WSNs, and describe the basic design criteria and challenges of transport protocols including energy-efficiency, quality of service, reliability, and congestion control. We then provide a summary and comparison of existing transport protocols for WSNs. Finally, we discuss several open problems.